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

distances_between_pairs_of_neighboring_stations = input().split()

for i in range(numbers_of_stations):
    distances_between_pairs_of_neighboring_stations[i] = int(distances_between_pairs_of_neighboring_stations[i])

departure_destination = input().split()

for i in range(2):
    departure_destination[i] = int(departure_destination[i])

departure_destination.sort()
departure = departure_destination[0]
destination = departure_destination[1]


distance_way_1 = 0
distance_way_2 = 0

for i in range(departure - 1, destination - 1):
    distance_way_1 += distances_between_pairs_of_neighboring_stations[i]

for i in range(destination - 1, numbers_of_stations):
    distance_way_2 += distances_between_pairs_of_neighboring_stations[i]

for i in range(0, departure - 1):
    distance_way_2 += distances_between_pairs_of_neighboring_stations[i]

print(min(distance_way_1, distance_way_2))