Train#2640
Pin has invented something again! This time, he created a train. Since Pin did not have much material, there is only one carriage, but it is a genuine sleeper carriage with a total of seats.
The lower berths have odd numbers, and the upper berths have even numbers.
Pin has already conducted some tests. The journey was rough, the train shook, and some seats in the carriage broke and became unusable. However, Pin is now sure that the remaining seats are sturdy and won't break!
When they heard about Pin's invention, Krosh and Hedgehog immediately wanted to try it out. They are a bit scared and want to travel together. But only one Smesharik can occupy each seat. Therefore, they want to choose two seats that are still usable. They want to pick two seats that are as close as possible within the compartment. If there are several such options, they prefer to avoid the side seats, because they seem suspiciously unstable. Among all such options, they want to select the one with the most lower berths, because the train shakes and you can fall from the upper berths. Help them choose two such seats.
The first line contains a natural number (2 \leq n \leq 54), the number of seats in the carriage that have not broken. The next line contains the numbers a_i (1 \leq a_i \leq 54) of these seats. All a_i are distinct.
Print two numbers — the seat numbers where Hedgehog and Krosh can travel. If there are multiple solutions, print any of them.
Example 1