The circle line of the Berland subway has $*n*$ stations. We know the distances between all pairs of neighboring stations:

• $*d*_{1}$ is the distance between the $1$-st and the $2$-nd station;
• $*d*_{2}$ is the distance between the $2$-nd and the $3$-rd station;...
• $*d*_{*n* - 1}$ is the distance between the $*n* - 1$-th and the $*n*$-th station;
• $*d*_{*n*}$ 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*$.

Input

The first line contains integer $*n*$ ($3 ≤ *n* ≤ 100$) — the number of stations on the circle line. The second line contains $*n*$ integers $*d*_{1}, *d*_{2}, ..., *d*_{*n*}$ ($1 ≤ *d*_{*i*} ≤ 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.

Output

Print a single number — the length of the shortest path between stations number $*s*$ and $*t*$.

Note

In the first sample the length of path $1 → 2 → 3$ equals 5, the length of path $1 → 4 → 3$ equals 13.

In the second sample the length of path $4 → 1$ is 100, the length of path $4 → 3 → 2 → 1$ is 15.

In the third sample the length of path $3 → 1$ is 1, the length of path $3 → 2 → 1$ is 2.

In the fourth sample the numbers of stations are the same, so the shortest distance equals 0.