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())

line = input()
line = line.split()
d = [int(x) for x in line]

line = input()
line = line.split()
s = int(line[0])
t = int(line[1])

if(s == t):
    print(0)

elif(s < t):
    clockwise = 0
    anticlockwise = 0
    for i in range(s-1, t-1):
        clockwise += d[i]
    if(s == 1):
        pos = n-1
    else:
        pos = s-2
    while(pos != t-2):
        anticlockwise += d[pos]
        if(pos - 1 < 0):
            pos = n-1
        else:
            pos -= 1
    print(min(clockwise, anticlockwise))
    
else:
    clockwise = 0
    anticlockwise = 0
    for i in range(t-1, s-1):
        clockwise += d[i]
    print(clockwise)
    if(t == 1):
        pos = n-1
    else:
        pos = t-2
    while(pos != s-2):
        anticlockwise += d[pos]
        if(pos - 1 < 0):
            pos = n-1
        else:
            pos -= 1
    print(min(clockwise, anticlockwise))
		 	 						 	 	 				 	     	 		