A. Anu Has a Functiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

Anu has created her own function f: f(x,y)=(x|y)−y where | denotes the bitwise OR operation. For example, f(11,6)=(11|6)−6=15−6=9. It can be proved that for any nonnegative numbers x and y value of f(x,y)

is also nonnegative.

She would like to research more about this function and has created multiple problems for herself. But she isn’t able to solve all of them and needs your help. Here is one of these problems.

A value of an array [a1,a2,…,an] is defined as f(f(…f(f(a1,a2),a3),…an−1),an)

(see notes). You are given an array with not necessarily distinct elements. How should you reorder its elements so that the value of the array is maximal possible?Input

The first line contains a single integer n (1≤n≤105

).

The second line contains n integers a1,a2,…,an (0≤ai≤109

). Elements of the array are not guaranteed to be different.Output

Output n

integers, the reordering of the array with maximum value. If there are multiple answers, print any.ExamplesInputCopy

OutputCopy

InputCopy

OutputCopy

Note

In the first testcase, value of the array [11,6,4,0] is f(f(f(11,6),4),0)=f(f(9,4),0)=f(9,0)=9

.

[11,4,0,6]

If you work on the bits, you may see f(a,b) can easily be written as a&(∼b)

.

And so, value of an array [a1,a2,…,an] would be a1&(∼a2)&…(∼an)

, meaning that if we are to reorder, only the first element matters.

By keeping prefix and suffix AND after we apply ∼ to the given array, we can find (∼a2)&…(∼an) in O(1)

.

Or notice that if a bit was to be in the answer, it must be in a1 and not in any of a2,a3,…an. So you can start from the most significant bit and check if that bit can be in the answer to find a1, resulting in O(n).