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())
a=list(map(int,input().split(' ')))
s,t=map(int,input().split(' '))
if s!=t:
	s-=1
	t-=1
	temp1=a[min(s,t)]
	temp2=a[max(s,t)]
	a[min(s,t)]=-1
	a[max(s,t)]=-2
	b=a[max(s,t):n]+a[min(s,t):max(s,t)]
	var1=sum(b[b.index(-2)+1:b.index(-1)])+temp2
	var2=sum(a[a.index(-1)+1:a.index(-2)])+temp1
	print(min(var1,var2))
else:
	print(0)