### COCI 2007/2008, Contest #1

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{|XPi|, 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.

### Input

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 109.

The third line contains the integers A and B (1 ≤ A < B ≤ 109), the range of names they are considering for the girl.

### Output

Output an integer, the name for the little girl.

```3
2 6 16
20 50```

`49`

```3
2 6 16
3 15```

`11`

```3
2 6 16
1 7```

### Output

`5`

Point Value: 7
Time Limit: 1.00s
Memory Limit: 32M