Brojko and Brojana are happily married with $N$ little boys. The boys are named with distinct even integers $P_1, P_2, \ldots , P_ N$.

Brojko and Brojana are expecting an addition to their family and have to come up with a nice name for the little girl. They have decided that the name will be an odd integer in the range $[A, B]$. Because they find all integers in that range equally beautiful, they have decided to choose the number which maximizes the distance to the name of the closest of the $N$ boys.

More precisely, they seek an odd integer $X \in [ A , B ]$ such that the expression\[ \min \{ |X - P_ i| , i \in [ 1 , N ] \} \]

is as large as possible.

Write a program that determines the name for the little girl.

-----Input-----
The first line contains an integer $N$ ($1\le N \le 100$), the number of boys.

The second line contains N distinct positive even integers, the names of the boys. The integers will be less than $10^9$.

The third line contains the integers $A$ and $B$ ($1 \le A < B \le 10^9$), the range of names they are considering for the girl.

-----Output-----
Output an integer, the name for the little girl. If there are multiple solutions, any one of them will be accepted.

-----Examples-----
Sample Input 1:
3
2 6 16
20 50
Sample Output 1:
49

Sample Input 2:
3
2 6 16
3 15
Sample Output 2:
11

Difficulty: interview

Starter code:

Solutions: