#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
long long a[N], b[2 * N], s[2 * N], p[N];
int n, m;
int main() {
  cin >> n;
  m = 100000;
  for (int i = 2; i <= n; i += 2) scanf("%I64d", &a[i]);
  s[0] = 1;
  for (int i = 1; i <= m; i++) {
    b[i] = 2 * i + 1;
    s[i] = s[i - 1] + b[i];
  }
  int l = 0, r = 1;
  for (int i = 2; i <= n; i += 2) {
    while (r <= m) {
      if (s[r] - s[l] == a[i]) break;
      if (s[r] - s[l] > a[i])
        l++;
      else
        r++;
    }
    if (r > m) {
      puts("No");
      return 0;
    }
    a[i - 1] = s[l] - p[i - 2];
    p[i - 1] = p[i - 2] + a[i - 1];
    p[i] = p[i - 1] + a[i];
    l = ++r;
  }
  puts("Yes");
  for (int i = 1; i <= n; i++) printf("%I64d ", a[i]);
  cout << endl;
}
