The circle line of the Berland subway has *n* stations. We know the distances between all pairs of neighboring stations:
-  *d*<sub class="lower-index">1</sub> is the distance between the 1-st and the 2-nd station;-  *d*<sub class="lower-index">2</sub> is the distance between the 2-nd and the 3-rd station;...-  *d*<sub class="lower-index">*n* - 1</sub> is the distance between the *n* - 1-th and the *n*-th station;-  *d*<sub class="lower-index">*n*</sub> is the distance between the *n*-th and the 1-st station.
The trains go along the circle line in both directions. Find the shortest distance between stations with numbers *s* and *t*.
The first line contains integer *n* (3 ≤ *n* ≤ 100) — the number of stations on the circle line. The second line contains *n* integers *d*<sub class="lower-index">1</sub>, *d*<sub class="lower-index">2</sub>, ..., *d*<sub class="lower-index">*n*</sub> (1 ≤ *d*<sub class="lower-index">*i*</sub> ≤ 100) — the distances between pairs of neighboring stations. The third line contains two integers *s* and *t* (1 ≤ *s*, *t* ≤ *n*) — the numbers of stations, between which you need to find the shortest distance. These numbers can be the same.

The numbers in the lines are separated by single spaces.
#d1 -> dist de 1 a 2
n = int(input())
d = input().split(" ")
sin = input().split(" ")

d = map(int, d)
d = list(d)

# 1 <= s
# t <= n
s = int(sin[0])
t = int(sin[1])

dist1 = 0
dist2 = 0

if s == t:
    print(0)
else:
    i = min(s, t) - 1
    j = max(s, t) - 1
    while i < j:
        dist1 += d[i]
        i += 1
        
    dist2 = sum(d) - dist1
    #print(dist1, dist2)
    print(min(dist1, dist2))
        
