A1103. [COCI-2007_2008-contest1]#3 PRINOVA

Brojko and Brojana are happily married with N little boys. The boys are named with distinct even integers P1, P2, ..., PN.
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 ∈[A,B] such that the expression min{X − Pi,i ∈[ ,1 N]}
is as large as possible.
Write a program that determines the name for the little girl. If there are multiple solutions, output any of them.

The first line contains an integer N (1 ≤ N ≤ 100), the number of boys.
The second line contains N distinct 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 ≤ A < B ≤ 10^9), the range of names they are considering for the girl.

Output an integer, the name for the little girl.