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.
#Amirhossein Alimirzaei
#@HajLorenzo

input()
_d=list(map(int,input().split()))
_=list(map(int,input().split()))
_s1=0
_s2=0
if _[0]>_[1]:
    _s1 = sum(_d[_[0] - 1:len(_d)])
    if _[1] > 1:
        _s1 += sum(_d[0:_[1]])
    _s2=sum(_d[_[1]-1:_[0]-1])
else:
    _s1=sum(_d[_[0]-1:_[1]-1])
    _s2=sum(_d[_[0]-1:_[1]-2])
    if _[0]>1:
        _s2=sum(_d[0:_[0]])
print(min(_s1,_s2))