#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const long long INF = (long long)1e14 + 5;
long long N, cur = 1, last = 0, ans[MAXN];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N;
  for (int i = 1; i <= N; i += 2) {
    long long x;
    cin >> x;
    while (cur * cur <= INF) {
      long long l = last + 1, r = cur - 1, found = -1;
      while (l <= r) {
        long long m = (l + r) >> 1;
        if (cur * cur - m * m == x) {
          found = m;
          break;
        } else if (cur * cur - m * m > x)
          l = m + 1;
        else
          r = m - 1;
      }
      if (found != -1) {
        ans[i] = found * found - last * last;
        ans[i + 1] = x;
        last = cur;
        cur++;
        break;
      }
      cur++;
    }
    if (cur * cur > INF) {
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  for (int i = 1; i <= N; i++) {
    cout << ans[i] << (i + 1 <= N ? ' ' : '\n');
  }
}
