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>
const long long mod = 1e9 + 7;
const double ex = 1e-10;
using namespace std;
long long a[112345];
vector<long long> aa[88];
int getid(long long x) {
  int ans = 0;
  while (x != 0LL) {
    ans++;
    x /= 2LL;
  }
  return ans - 1;
}
vector<long long> res;
int tmp[88];
int maxid;
bool check(long long x) {
  int id = getid(x);
  if (id < maxid) return true;
  if (tmp[id] + 1 != aa[id].size()) return true;
  return false;
}
long long shit[88];
int main() {
  int N;
  cin >> N;
  shit[0] = 1;
  for (int i = 1; i <= 66; i++) {
    shit[i] = shit[i - 1] * 2LL;
  }
  long long ans = 0;
  for (int i = 1; i <= N; i++) {
    cin >> a[i];
    int id = getid(a[i]);
    maxid = max(maxid, id);
    aa[id].push_back(a[i]);
    ans = ans ^ a[i];
  }
  while (res.size() < N) {
    if (check(ans) || ans == 0) {
      puts("No");
      return 0;
    }
    int id = 0;
    int bid = getid(ans);
    while ((tmp[id] + 1 >= aa[id].size() || (ans & shit[id]) != shit[id]) &&
           (id != bid))
      id++;
    if (tmp[id] == aa[id].size()) {
      puts("No");
      return 0;
    }
    res.push_back(aa[id][tmp[id]]);
    ans = ans ^ aa[id][tmp[id]++];
    while (tmp[maxid] == aa[maxid].size()) maxid--;
  }
  puts("Yes");
  for (int i = N - 1; i >= 0; i--) {
    cout << res[i] << " ";
  }
  return 0;
}
