Train
Pin has created another invention! This time, it's a train. Due to limited materials, it only has one carriage, but it's a genuine sleeper carriage with fifty-four seats in total.
In this carriage, the lower berths are assigned odd numbers, while the upper berths have even numbers.
Pin has already run some tests. The journey was rough, the train shook, and some seats in the carriage broke and became unusable. However, Pin is now confident that the remaining seats are sturdy and won't break!
Upon hearing about Pin's invention, Krosh and Hedgehog were eager to try it out. They are a bit apprehensive and wish to travel together. However, only one Smesharik can occupy a seat. Therefore, they want to select two seats that are still usable. They aim to choose two seats that are as close as possible within the compartment. If there are several such options, they prefer to avoid the side seats, as they seem suspiciously unstable. Among all these options, they want to choose the one with the most lower berths, because the train shakes, and you can fall from the upper berths. Help them select two such seats.
Input
The first line contains a natural number n (2 ≤ n ≤ 54) - the number of seats in the carriage that haven't fallen apart. The next line lists the numbers a_i (1 ≤ a_i ≤ 54) of these seats. All a_i are distinct.
Output
Output two numbers - the seat numbers where Hedgehog and Krosh can travel. If there are multiple solutions, you may output any.