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, …, a_n. In order to not reveal the secret earlier than needed, Vitya encrypted the answer and obtained the sequence b_1, …, b_n using the following rules:

  * b_1 = a_1;
  * b_i = a_i ⊕ a_{i - 1} for all i from 2 to n, where x ⊕ y is the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of x and y. 



It is easy to see that the original sequence can be obtained using the rule a_i = b_1 ⊕ … ⊕ 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 ⊕ … ⊕ b_i is strictly increasing. Help him find such a permutation or determine that it is impossible.

Input

The first line contains a single integer n (1 ≤ n ≤ 10^5).

The second line contains n integers b_1, …, b_n (1 ≤ b_i < 2^{60}).

Output

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, …, b'_n — a valid permutation of integers b_i. The unordered multisets \\{b_1, …, b_n\} and \\{b'_1, …, 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 ⊕ … ⊕ b'_i should be strictly increasing.

If there are multiple answers, print any of them.

Examples

Input

3
1 2 3


Output

No


Input

6
4 7 7 12 31 61


Output

Yes
4 12 7 31 7 61 

Note

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.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, LOG = 60;
int n, go[maxn * LOG][2], cnt[maxn * LOG], sz;
vector<long long> ans;
int newNode() {
  go[sz][0] = go[sz][1] = -1;
  return sz++;
}
void Add(long long x) {
  int v = 0;
  cnt[v]++;
  for (int i = LOG - 1; i >= 0; i--) {
    bool y = x >> i & 1;
    if (go[v][y] == -1) go[v][y] = newNode();
    v = go[v][y];
    cnt[v]++;
  }
}
long long Solve(int cur, bool dec) {
  int v = 0;
  long long ret = 0;
  if (dec) cnt[v]--;
  for (int i = LOG - 1; i >= 0; i--) {
    if (i > cur) {
      if (cnt[go[v][0]] == 0) return -1;
      v = go[v][0];
    } else if (i == cur) {
      if (cnt[go[v][1]] == 0) return -1;
      v = go[v][1];
      ret += 1LL << i;
    } else {
      if (cnt[go[v][0]]) {
        v = go[v][0];
      } else {
        v = go[v][1];
        ret += 1LL << i;
      }
    }
    if (dec) cnt[v]--;
  }
  return ret;
}
long long Query(long long x) {
  for (int i = 0; i < LOG; i++) {
    bool y = x >> i & 1;
    if (!y && Solve(i, false) != -1) {
      return Solve(i, true);
    }
  }
  return -1;
}
int main() {
  newNode();
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    long long x;
    scanf("%lld", &x);
    Add(x);
  }
  long long cur = 0;
  for (int i = 0; i < n; i++) {
    long long t = Query(cur);
    if (t != -1)
      ans.push_back(t), cur ^= t;
    else
      return !printf("No");
  }
  puts("Yes");
  for (int i = 0; i < n; i++) printf("%lld ", ans[i]);
  return 0;
}
