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())
d = input().split()
d = [int(x) for x in d]
D = 2*d
s,t = map(int,input().split())
sum1 = 0
for i in range(s-1,t-2+1) :
    sum1 += D[i]
sum2 = 0
for i in range(t-1,len(d)+(s-2)+1) :
    sum2 += D[i]
print(min(sum1,sum2))
print(sum1)
print(sum2)
# 4
#  0   1   2   3   4   5   6   7 
# 1-2 2-3 3-4 4-1 1-2 2-3 3-4 4-1
#  2   3   4   9   2   3   4   9
# 1 3
# D[s-1]+D[t-2]
# D[t-1]+D[len(d)-(s-1)]