#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long n, i, j, k, l, sum = 0, flag = 0, t, ans = 0, b[200005];
vector<pair<long long, long long> > a[200005];
bool comp(pair<long long, long long> p, pair<long long, long long> q) {
  return p.second - p.first < q.second - q.first;
}
void f(long long pos, long long prev) {
  if (pos == n + 1) {
    cout << "Yes\n";
    for (long long i = 1; i <= n; i++) {
      cout << b[i] << " ";
    }
    exit(0);
  }
  for (auto j : a[b[pos + 1]]) {
    long long z2 = (j.second + j.first) / 2;
    long long z1 = (j.second - j.first) / 2;
    long long first = z1 * z1 - prev;
    if (first <= 10000000000000LL && first > 0) {
      b[pos] = first;
      f(pos + 2, prev + b[pos] + b[pos + 1]);
      break;
    }
  }
  cout << "No\n";
  exit(0);
}
void solve() {
  for (long long i = 1; i <= 200000; i++) {
    for (long long j = i; j <= 200000; j += i) {
      long long k = j / i;
      if (i % 2 == k % 2) {
        a[j].push_back({min(i, k), max(i, k)});
      }
    }
    sort((a[i]).begin(), (a[i]).end(), comp);
  }
  cin >> n;
  for (long long i = 2; i <= n; i += 2) {
    cin >> b[i];
  }
  f(1, 0);
  cout << "No\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long test = 1;
  while (test--) {
    solve();
  }
  return 0;
}
