cho.shChoosing a Name
Time limit1sMemory limit128 MBProblem
A person has N sons, and each son's name is an even positive integer P1, P2, ..., PN.
A daughter will be born soon, and her name must be an odd positive integer. A candidate name X for the daughter must lie in the interval [A, B]. The beauty of X is the distance to the closest son's name, that is min{|X - Pi| | 1 <= i <= N}.
Output one odd positive integer X whose beauty is as large as possible. If several values of X are possible, you may output any one of them.
Input
The first line contains the number of sons N. (1 <= N <= 100)
The second line contains the sons' names P1, P2, ..., PN separated by spaces. Each name is an even positive integer less than 10^9.
The third line contains two integers A and B. (1 <= A < B <= 10^9)
Output
Output a daughter's name X that satisfies the conditions and has maximum beauty.