#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 1067, mxx = 10000000;
long long res[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, k;
  cin >> n;
  long long cur = 0;
  for (int i = 1; i <= n / 2; i++) {
    int xx;
    cin >> xx;
    long long newC = mxx;
    for (int de = 1; de <= trunc(sqrt(xx)); de++)
      if (xx % de == 0) {
        int in = xx / de;
        if (in % 2 != de % 2) continue;
        int a = (in - de) / 2;
        int b = in - a;
        if (a <= cur) continue;
        newC = min(newC, (long long)a);
      }
    if (newC == mxx) {
      cout << "No" << endl;
      return 0;
    }
    res[i * 2 - 1] = newC * newC - cur * cur;
    res[i * 2] = xx;
    cur = trunc(sqrt(newC * newC + xx));
  }
  cout << "Yes" << endl;
  for (int i = 1; i <= n; i++) cout << res[i] << " ";
  cout << endl;
  return 0;
}
