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

x=input().split()

asdf,zxcv=input().split()

targetA,targetB=int(asdf)-1,int(zxcv)-1

stationDistances=[0]*stations


if targetB<targetA:

  asdf=targetA

  zxcv=targetB

  targetA=zxcv

  targetB=asdf


for i in range(stations):

    stationDistances[i]=int(x[i])


i=targetA

forwardDist=0

while i!=targetB:

  forwardDist+=stationDistances[i]

  i+=1

  if i>=stations:

    i=0


i=targetA

backwardDist=0

while i!=targetB:

  i-=1

  if i<0:

    i=stations-1

  backwardDist+=stationDistances[i]


if forwardDist>backwardDist:

    print(backwardDist)

else:

    print(forwardDist)