#include <bits/stdc++.h>
using namespace std;
long long int INF = 9e18;
long long int mod = 1e9 + 7;
void solve(vector<long long int> &v1) {
  long long int n = v1.size(), i, j, t;
  vector<long long int> ans;
  long long int now = 1, sum = 0;
  for (i = 0; i < n; i++) {
    if (now >= v1[i]) {
      cout << "No" << endl;
      return;
    }
    long long int temp2 = 0;
    for (j = now; j < v1[i]; j += 2) {
      temp2 += j;
      long long int val1 = (long long int)sqrt(sum + temp2 + v1[i]);
      if (val1 * val1 == sum + v1[i] + temp2) break;
    }
    if (j >= v1[i]) {
      cout << "No" << endl;
      return;
    }
    ans.push_back(((j + 1) / 2) * ((j + 1) / 2) - sum);
    ans.push_back(v1[i]);
    sum += v1[i] + ans[ans.size() - 2];
    long long int temp1 = (long long int)sqrt(sum);
    now = 1 + (temp1)*2;
  }
  cout << "Yes" << endl;
  for (i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int test_case = 1;
  while (test_case--) {
    long long int n, i, j, t;
    cin >> n;
    vector<long long int> v1(n / 2);
    for (i = 0; i < n / 2; i++) cin >> v1[i];
    solve(v1);
  }
}
