CF925C.Big Secret

Vitya has learned that the answer for The Ultimate Question of Life, the Universe, and Everything is not the integer 54 42, but an increasing integer sequence $a_1, \ldots, a_n$. In order to not reveal the secret earlier than needed, Vitya encrypted the answer and obtained the sequence $b_1, \ldots, b_n$ using the following rules:

• $b_1 = a_1$;
• $b_i = a_i \oplus a_{i - 1}$ for all $i$ from 2 to $n$, where $x \oplus y$ is the bitwise XOR of $x$ and $y$.

It is easy to see that the original sequence can be obtained using the rule $a_i = b_1 \oplus \ldots \oplus b_i$.

However, some time later Vitya discovered that the integers $b_i$ in the cypher got shuffled, and it can happen that when decrypted using the rule mentioned above, it can produce a sequence that is not increasing. In order to save his reputation in the scientific community, Vasya decided to find some permutation of integers $b_i$ so that the sequence $a_i = b_1 \oplus \ldots \oplus b_i$ is strictly increasing. Help him find such a permutation or determine that it is impossible.

维佳得知，“生命、宇宙以及一切的终极问题”的答案并非整数 54 42，而是一个严格递增的整数序列 $a_1, \ldots, a_n$。为了不提前泄露这一秘密，维佳对答案进行了加密，得到序列 $b_1, \ldots, b_n$，加密规则如下：

• $b_1 = a_1$；
• 对所有 $i$ 从 2 到 $n$，有 $b_i = a_i \oplus a_{i - 1}$，其中 $x \oplus y$ 表示 $x$ 与 $y$ 的按位异或运算。

容易验证，原始序列可通过规则 $a_i = b_1 \oplus \ldots \oplus b_i$ 还原。

然而，过了一段时间，维佳发现密文中的整数 $b_i$ 被打乱了顺序，此时若直接按上述规则解密，所得序列可能不再递增。为维护自己在科学界中的声誉，瓦夏决定找出 $b_i$ 的某个排列，使得由 $a_i = b_1 \oplus \ldots \oplus b_i$ 所生成的序列严格递增。请帮助他找到这样的一个排列，或判定其不存在。

The first line contains a single integer $n$ ($1 \leq n \leq 10^5$).

The second line contains $n$ integers $b_1, \ldots, b_n$ ($1 \leq b_i \lt 2^{60}$).

第一行包含一个整数 $n$（$1 \leq n \leq 10^5$）。

第二行包含 $n$ 个整数 $b_1, \ldots, b_n$（$1 \leq b_i \lt 2^{60}$）。

If there are no valid permutations, print a single line containing "No".

Otherwise in the first line print the word "Yes", and in the second line print integers $b'_1, \ldots, b'_n$ — a valid permutation of integers $b_i$. The unordered multisets ${b_1, \ldots, b_n}$ and ${b'_1, \ldots, b'_n}$ should be equal, i. e. for each integer $x$ the number of occurrences of $x$ in the first multiset should be equal to the number of occurrences of $x$ in the second multiset. Apart from this, the sequence $a_i = b'_1 \oplus \ldots \oplus b'_i$ should be strictly increasing.

If there are multiple answers, print any of them.

如果不存在合法的排列，则输出一行“No”。

否则，第一行输出“Yes”，第二行输出整数 $b'_1, \ldots, b'_n$ —— 即整数 $b_i$ 的一个合法排列。多重集 $\{b_1, \ldots, b_n\}$ 与 $\{b'_1, \ldots, b'_n\}$ 应当无序相等，即对每个整数 $x$，其在第一个多重集中出现的次数应等于其在第二个多重集中出现的次数。此外，序列 $a_i = b'_1 \oplus \ldots \oplus b'_i$ 必须严格递增。

若存在多个答案，输出任意一个即可。

In the first example no permutation is valid.

In the second example the given answer lead to the sequence $a_1 = 4$, $a_2 = 8$, $a_3 = 15$, $a_4 = 16$, $a_5 = 23$, $a_6 = 42$.

在第一个例子中，不存在有效的排列。

在第二个例子中，给定的答案生成了序列 $a_1 = 4$，$a_2 = 8$，$a_3 = 15$，$a_4 = 16$，$a_5 = 23$，$a_6 = 42$。