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;
int const B = 61;
int const MAX = 1e5 + 41;
bool bit(long long m, int i) { return (m & (1LL << i)); }
struct Trie {
  Trie *one, *zero;
  int q;
  vector<int> pos;
  Trie() {
    q = 0;
    one = zero = NULL;
  };
  void push(long long m, int p, int b = B) {
    q++;
    if (b == -1) {
      pos.push_back(p);
      return;
    }
    if (bit(m, b)) {
      if (!one) one = new Trie();
      one->push(m, p, b - 1);
    } else {
      if (!zero) zero = new Trie();
      zero->push(m, p, b - 1);
    }
  }
  void pop(long long m, int p, int b = B) {
    q--;
    if (b == -1) {
      pos.pop_back();
      return;
    }
    if (bit(m, b)) {
      one->pop(m, p, b - 1);
    } else {
      zero->pop(m, p, b - 1);
    }
  }
  int go(long long m, long long cur, int f = 0, int b = B) {
    if (q == 0) return -1;
    if (b == -1) {
      if (!f) return -1;
      return pos.back();
    }
    if (f) {
      if (bit(m, b)) {
        if (one && one->q) {
          return one->go(m, cur, 1, b - 1);
        } else {
          if (!zero) return -1;
          return zero->go(m, cur, 1, b - 1);
        }
      } else {
        if (zero && zero->q) {
          return zero->go(m, cur, 1, b - 1);
        } else {
          if (!one) return -1;
          return one->go(m, cur, 1, b - 1);
        }
      }
    } else {
      if (bit(m, b)) {
        if (bit(cur, b)) {
          if (!zero) return -1;
          return zero->go(m, cur, 0, b - 1);
        } else {
          if (one) {
            int resp = one->go(m, cur, 0, b - 1);
            if (resp != -1) return resp;
          }
          if (zero) {
            return zero->go(m, cur, 1, b - 1);
          }
          return -1;
        }
      } else {
        if (bit(cur, b)) {
          if (!one) return -1;
          return one->go(m, cur, 0, b - 1);
        } else {
          if (zero) {
            int resp = zero->go(m, cur, 0, b - 1);
            if (resp != -1) return resp;
          }
          if (one) {
            return one->go(m, cur, 1, b - 1);
          }
          return -1;
        }
      }
    }
  }
};
Trie root;
long long a[MAX];
int n;
long long b[MAX];
long long ans[MAX];
long long const INF = 4e18;
void bad() {
  printf("No\n");
  exit(0);
}
void solve() {
  for (int i = 1; i <= n; i++) {
    root.push(a[i], i);
  }
  ans[0] = 0;
  long long mask = 0;
  for (int i = 1; i <= n; i++) {
    int pos = root.go(mask, ans[i - 1]);
    if (pos == -1) {
      bad();
    }
    ans[i] = (mask ^ a[pos]);
    mask ^= a[pos];
    root.pop(a[pos], pos);
    b[i] = a[pos];
  }
  for (int i = 2; i <= n; i++) {
    if (ans[i] <= ans[i - 1]) bad();
  }
  printf("Yes\n");
  for (int i = 1; i <= n; i++) {
    printf("%lld ", b[i]);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  solve();
  return 0;
}
