#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 10, MOD = 998244353;
long long n, x, a[200000], s[200000];
long long sq(long long x) {
  long long l = 1, r = x / 2;
  while (l < r) {
    long long m = (l + r + 1) / 2;
    if (m * m <= x)
      l = m;
    else
      r = m - 1;
  }
  return l;
}
int main() {
  cin >> n;
  cin >> x;
  for (long long i = 1; i <= 10000000; i++) {
    long long d = sq(i * i + x);
    if (d * d == i * i + x) {
      a[0] = i * i;
      a[1] = x;
      s[0] = i * i;
      s[1] = i * i + x;
      break;
    }
    if (x < 2 * i + 1) {
      cout << "No";
      return 0;
    }
  }
  for (long long i = 2; i < n; i += 2) {
    scanf("%lld", &x);
    for (long long j = sq(s[i - 1]) + 1; j <= 10000000; j++) {
      long long d = sq(j * j + x);
      if (d * d == j * j + x) {
        a[i] = j * j - s[i - 1];
        a[i + 1] = x;
        s[i] = j * j;
        s[i + 1] = j * j + x;
        break;
      }
      if (x < 2 * j + 1) {
        cout << "No";
        return 0;
      }
    }
  }
  cout << "Yes\n";
  for (long long i = 0; i < n; i++) {
    printf("%lld ", a[i]);
  }
}
