#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 2;
const long double eps = 1e-9;
const long double pi = acos(-1);
template <typename T>
inline bool mineq(T& a, T b) {
  return (a > b) ? (a = b, 1) : 0;
}
template <typename T>
inline bool maxeq(T& a, T b) {
  return (a < b) ? (a = b, 1) : 0;
}
inline void solve(), read();
const string file = "";
signed main() {
  if (file != "") {
    freopen((file + ".in").c_str(), "r", stdin);
    freopen((file + ".out").c_str(), "w", stdout);
  }
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  read();
  solve();
  return 0;
}
long long n;
vector<long long> a;
vector<long long> xs;
const long long MAXN = 1e13;
long long check(long long p) {
  long long sq = sqrtl(p);
  return sq * sq == p;
}
inline void solve() {
  long long s = 0;
  for (long long i = 0; i < (long long)((a).size()); i++) {
    long long j = floor(sqrtl(s)) + 1;
    long long p = j * j - s;
    long long q = a[i];
    while (!check(s + p) || !check(s + p + q)) {
      ++j;
      p = j * j - s;
      if (p > MAXN) {
        cout << "No"
             << "\n";
        return;
      }
    }
    xs.push_back(p);
    xs.push_back(a[i]);
    s += p;
    s += a[i];
  }
  cout << "Yes"
       << "\n";
  for (long long i = 0; i < n; i++) {
    cout << xs[i] << " ";
  }
  cout << "\n";
}
inline void read() {
  cin >> n;
  a.resize(n / 2);
  for (long long i = 0; i < n / 2; i++) {
    cin >> a[i];
  }
}
