B'Mishka got an integer array a of length n as a birthday present (what a surprise!). Mishka doesn 't like this present and wants to change it somehow. He has invented an algorithm and called it "Mishka 's Adjacent Replacements Algorithm". This algorithm can be represented as a sequence of steps: Note that the dots in the middle of this algorithm mean that Mishka applies these replacements for each pair of adjacent integers ( 2i - 1, 2i ) for each i in {1, 2, ldots, 5 cdot 10^8 } as described above. For example, for the array a = [1, 2, 4, 5, 10] , the following sequence of arrays represents the algorithm: [1, 2, 4, 5, 10] rightarrow (replace all occurrences of 1 with 2 ) rightarrow [2, 2, 4, 5, 10] rightarrow (replace all occurrences of 2 with 1 ) rightarrow [1, 1, 4, 5, 10] rightarrow (replace all occurrences of 3 with 4 ) rightarrow [1, 1, 4, 5, 10] rightarrow (replace all occurrences of 4 with 3 ) rightarrow [1, 1, 3, 5, 10] rightarrow (replace all occurrences of 5 with 6 ) rightarrow [1, 1, 3, 6, 10] rightarrow (replace all occurrences of 6 with 5 ) rightarrow [1, 1, 3, 5, 10] rightarrow ... rightarrow [1, 1, 3, 5, 10] rightarrow (replace all occurrences of 10 with 9 ) rightarrow [1, 1, 3, 5, 9] . The later steps of the algorithm do not change the array. Mishka is very lazy and he doesn 't want to apply these changes by himself. But he is very interested in their result. Help him find it. The first line of the input contains one integer number n ( 1 <= n <= 1000 ) -- the number of elements in Mishka 's birthday present (surprisingly, an array). The second line of the input contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ) -- the elements '...