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;
long long res[maxn];
long long b[maxn];
int bit[60];
int flag;
int o[60];
struct node {
  int num;
  node *tree[2];
} * a;
void init(node *x) {
  x->num = 0;
  x->tree[0] = nullptr;
  x->tree[1] = nullptr;
}
int cmp(long long a, long long b) { return a < b; }
void Add() {
  node *head = a;
  for (int i = 0; i < 60; i++) {
    int pos = bit[i];
    if (head->tree[pos] == nullptr) {
      head->tree[pos] = new node;
      head = head->tree[pos];
      init(head);
      head->num++;
    } else {
      head = head->tree[pos];
      head->num++;
    }
  }
}
void transport(long long x) {
  memset(bit, 0, sizeof(bit));
  int e = 0;
  while (x) {
    bit[e++] = (int)x & 1;
    x >>= 1;
  }
  reverse(bit, bit + 60);
}
long long Find(long long x) {
  transport(x);
  node *head = a, *k;
  int f = -1;
  for (int i = 0; i < 60; i++) {
    if (bit[i] == 1) {
      f = i;
      break;
    }
  }
  int Index = -1;
  for (int i = 0; i < 60; i++) {
    int pos = bit[i];
    if (pos == 0 && head->tree[1] != nullptr) {
      k = head;
      Index = i;
      flag = 1;
    }
    if (i == f) {
      if (head->tree[0] != nullptr)
        head = head->tree[0];
      else {
        break;
      }
    } else {
      if (head->tree[0] != nullptr)
        head = head->tree[0];
      else
        break;
    }
  }
  if (!flag) return 0;
  memset(o, 0, sizeof(o));
  int e = 0;
  for (int i = Index; i < 60; i++) {
    if (i == Index) {
      o[i] = 1;
      node *tmp = k;
      k = k->tree[1];
      k->num--;
      if (k->num == 0) {
        tmp->tree[1] = nullptr;
      }
    } else {
      int pos = bit[i];
      if (k->tree[pos] != nullptr) {
        node *tmp = k;
        k = k->tree[pos];
        k->num--;
        if (k->num == 0) {
          tmp->tree[pos] = nullptr;
        }
        o[i] = pos;
      } else if (k->tree[!pos] != nullptr) {
        node *tmp = k;
        k = k->tree[!pos];
        k->num--;
        if (k->num == 0) {
          tmp->tree[!pos] = nullptr;
        }
        o[i] = !pos;
      }
    }
  }
  long long kk = 1;
  long long ans = 0;
  for (int j = 59; j >= 0; j--) {
    if (o[j]) {
      ans += kk;
    }
    kk <<= 1;
  }
  return ans ^ x;
}
int main() {
  int n;
  scanf("%d", &n);
  a = new node;
  init(a);
  for (int i = 0; i < n; i++) {
    scanf("%lld", &b[i]);
  }
  sort(b, b + n, cmp);
  res[0] = b[0];
  for (int i = 1; i < n; i++) {
    transport(b[i]);
    Add();
  }
  for (int i = 1; i < n; i++) {
    flag = 0;
    res[i] = Find(res[i - 1]);
    if (flag == 0) {
      printf("No\n");
      return 0;
    }
  }
  printf("Yes\n");
  printf("%lld", res[0]);
  for (int i = 1; i < n; i++) {
    printf(" %lld", res[i] ^ res[i - 1]);
  }
  return 0;
}
