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())
distancias = list(input().split())
origem, destino = input().split()
origem, destino = int(origem), int(destino)
if origem > destino:
	origem, destino = destino, origem

path1 = [i for i in range(origem-1, destino-1)]
path2 = [i for i in range(n) if i not in path1]
# i = destino
# while i != origem:
# 	path2.append(i)
# 	i = (i+1)%n

sum_path1 = 0
for i in path1:
	sum_path1+=int(distancias[i])


sum_path2 = 0
for i in path2:
	sum_path2+=int(distancias[i])

print(min(sum_path1, sum_path2))
# print(sum_path2)
# print(sum_path1)