#include <bits/stdc++.h>
using namespace std;
long long n, a[100100], m = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i += 2) {
    cin >> a[i + 1];
    long long best = 1e17;
    for (int j = 1; j * j <= a[i + 1]; j++) {
      if (a[i + 1] % j != 0) continue;
      long long l = j, r = a[i + 1] / j;
      if ((l + r) % 2 != 0) continue;
      long long mid = (l + r) / 2;
      long long small = mid - l, large = r - mid;
      small *= small;
      large *= large;
      if (small <= m) continue;
      best = min(small, best);
    }
    if (best > 1e13) {
      cout << "No";
      return 0;
    }
    a[i] = best - m;
    m += a[i] + a[i + 1];
  }
  cout << "Yes" << endl;
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
}
