#include <bits/stdc++.h>
using namespace std;
struct node {
  int nxt[2];
  int cnt;
  node() {
    cnt = 0;
    nxt[0] = nxt[1] = 0;
  }
};
struct trie {
  vector<node> tree;
  int n;
  trie(int n) : n(n) { tree.resize(n + 1, node()); }
  void add(long long val) {
    static int count = 0;
    int root = 0;
    for (int i = 59; i >= 0; i--) {
      int now = val >> i & 1;
      if (!tree[root].nxt[now]) {
        tree[root].nxt[now] = ++count;
      }
      root = tree[root].nxt[now];
      tree[root].cnt++;
    }
  }
  void del(long long val) {
    int root = 0;
    for (int i = 59; i >= 0; i--) {
      int now = val >> i & 1;
      int nxt = tree[root].nxt[now];
      tree[nxt].cnt--;
      if (!tree[nxt].cnt) {
        tree[root].nxt[now] = 0;
        break;
      }
      root = nxt;
    }
  }
  long long find(long long here, int mn) {
    int root = 0;
    long long res = 0;
    for (int i = 59; i >= 0; i--) {
      if (i > mn) {
        assert(tree[root].nxt[0]);
        root = tree[root].nxt[0];
      } else if (i == mn) {
        assert(tree[root].nxt[1]);
        root = tree[root].nxt[1];
        res |= 1ll << i;
      } else {
        int val = here >> i & 1;
        int now = 0;
        if (!val) {
          if (!tree[root].nxt[0]) now = 1;
        } else {
          if (tree[root].nxt[1]) now = 1;
        }
        if (now == 1) res |= 1ll << i;
        root = tree[root].nxt[now];
      }
    }
    return res;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<long long> a(n);
  vector<int> cnt(60);
  trie Tree(n * 60);
  for (auto& x : a) {
    cin >> x;
    Tree.add(x);
    for (int i = 59; i >= 0; i--) {
      if (x >> i & 1) {
        ++cnt[i];
        break;
      }
    }
  }
  long long val = 0;
  vector<long long> res;
  for (int i = 1; i <= n; i++) {
    int pos = -1;
    for (int j = 0; j < 60; j++) {
      if (val >> j & 1) continue;
      if (!cnt[j]) continue;
      pos = j;
      break;
    }
    if (pos == -1) return cout << "No", 0;
    res.emplace_back(Tree.find(val, pos));
    for (int j = 59; j >= 0; j--) {
      if (res.back() >> j & 1) {
        cnt[j]--;
        break;
      }
    }
    val ^= res.back();
    Tree.del(res.back());
  }
  cout << "Yes\n";
  for (auto& x : res) cout << x << " ";
}
