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.
cases = input()

y = input().split()
z = input().split()
stat = []
dist = []
for i in y :
    dist.append(int(i))

for j in z:
    stat.append(int(j))
    
c1 = stat[0] - 1

tot1 = 0
    
diff = abs(stat[0] - stat[1])
for k in range(diff):
    tot1 = tot1 + dist[c1]
    c1 = (c1 + 1) % len(dist)

tot2 = 0
c2 = stat[-1] -1
while c2 != c1 :
    tot2 = tot2 + dist[c2]
    c2 = (c2 + 1) % len(dist)
    
if tot1 < tot2 :
    print(tot1)
    
else :
    print(tot2)

