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())
s=''
x=0
d={}
z=0
n1=list(map(int,input().split()))
n2=list(map(int,input().split()))
for i in range(1,n+1):
    s=s+str(i)
s=s+s
m=0
for j in range(n):
    d[j+1]=n1[j]
w=s[s.index(str(n2[0])):]
for k in w:
    if(k==str(n2[1])):
        break
    else:
        z=z+d[int(k)]
n2.reverse()
b=s[s.index(str(n2[0])):]
for c in b:
    if(c==str(n2[1])):
        break
    else:
        x=x+d[int(c)]
print(min(x,z))
    
