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.
n=int(input())
li=[int(i) for i in input().split()]
f,l=[int(i) for i in input().split()]

if f==l:
    print(0)
    exit()
fs=0

if f < l:
    fs=l-f
elif  f == n:
    fs=l
else:
    fs=(n-f)+l

sum1=0
steps=0
i=f-1
while steps < fs:
    sum1=sum1+li[i]
    steps=steps+1
    if i == n:
        i = 0
    else:
        i=i+1

fl=0

if f < l:
    fl=(f-1)+(n-l)
else:
    fl=f-l

sum2=0
steps=0
i=-(n-(f-1))
if i == -n:
    i = -1
else:
    i = i - 1

while steps < fl:
    sum2=sum2+li[i]
    steps=steps+1
    if i == -n:
        i = -1
    else:
        i = i - 1

print(min(sum1,sum2))