#include <bits/stdc++.h>
#pragma optimize("", off)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:36777216")
const long long inf = 0x3f3f3f3f3f3f3f3LL;
const long long mod = 1e9 + 7;
using namespace std;
template <class T>
void smin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void smax(T& a, T val) {
  if (a < val) a = val;
}
template <typename T>
inline std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
  bool first = true;
  os << "[";
  for (auto i : v) {
    if (!first) os << ", ";
    os << i;
    first = false;
  }
  return os << "]";
}
const long long N = 2 * 1e5 + 10;
long long n, x[N];
long long solve(long long ptr, long long before_sum, long long next) {
  while ((ptr + 1) * (ptr + 1) - ptr * ptr <= next) {
    long long tt = sqrtl(ptr * ptr + next);
    if (tt * tt == (ptr * ptr + next)) {
      return ptr * ptr - before_sum;
    }
    ptr++;
  }
  return -1;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (long long i = 2; i <= n; i += 2) {
    cin >> x[i];
  }
  long long before = 0;
  for (long long i = 1; i < n; i += 2) {
    long long root = sqrtl(before);
    assert(root * root == before);
    x[i] = solve(root + 1, before, x[i + 1]);
    if (x[i] == -1) {
      cout << "No";
      return 0;
    }
    before += x[i] + x[i + 1];
  }
  cout << "Yes" << '\n';
  for (long long i = 1; i <= n; ++i) {
    cout << x[i] << ' ';
  }
  return 0;
}
