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.
def reversed_list(l, start, end):
    if start >= end:
        return l
    l[start], l[end] = l[end], l[start]
    return reversed_list(l, start + 1, end - 1)



def main_function():
    n = int(input())
    l = [int(i) for i in input().split(" ")]
    s_1, s_2 = [int(i) - 1 for i in input(" ")]
    route_1 = 0
    route_2 = 0
    for i in range(len(l)):
        if i >= s_1 and i < s_2:
            route_1 += l[i]
        else:
            route_2 += l[i]
    return min(route_2, route_1)


print(main_function())