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())
lis = list(map(int , input().split()))
s , t = map(int , input().split())
lis3 = [s ,t]
j = min(lis3)
i = max(lis3)

i2 = max(lis3)
j2 = min(lis3)
sum1 = 0
sum2 = 0
lis2 =[]
for k in range(1,n+1):
    lis2.append(k)
if s != t :
 while True:
    if i == n:
        sum1+=lis[i - 1]
        i = 1
    if i == j:
        break
    sum1+=lis[i - 1]
    i+=1

 while j2 < i2:
       sum2+=lis[j2 - 1]
       j2+=1
 if sum1 > sum2:
     print(sum2)
 else:
     print(sum1)
else:
    print(0)