#include <bits/stdc++.h>
using namespace std;
template <typename num_t>
inline void addmod(num_t& a, const long long& b, const int& m) {
  a = (a + b) % m;
  if (a < 0) a += m;
}
template <typename num_t>
inline void update_max(num_t& a, const num_t& b) {
  a = max(a, b);
}
template <typename num_t>
inline void update_min(num_t& a, const num_t& b) {
  a = min(a, b);
}
template <typename num_t>
num_t gcd(num_t lhs, num_t rhs) {
  return !lhs ? rhs : gcd(rhs % lhs, lhs);
}
template <typename num_t>
num_t pw(num_t n, num_t k, num_t mod) {
  num_t res = 1;
  for (; k > 0; k >>= 1) {
    if (k & 1) res = 1ll * res * n % mod;
    n = 1ll * n * n % mod;
  }
  return res;
}
const int inf = 1e9 + 7;
const int mod = 998244353;
const int MAX_N = 100000 + 7;
const long long ll_inf = 9ll * inf * inf;
int n;
long long a[MAX_N];
long long sum[MAX_N];
void solve() {
  cin >> n;
  for (int i = 2; i <= n; i += 2) cin >> a[i];
  for (int i = n; i > 0; i -= 2) {
    bool found = false;
    for (int d = 1; d * d <= a[i]; ++d)
      if (a[i] % d == 0) {
        long long u = d, v = a[i] / d;
        if (u != v && ((u + v) & 1) == 0) {
          long long up = (u + v) / 2;
          up *= up;
          long long down = abs(u - v) / 2;
          down *= down;
          if (i == n || (up < sum[i + 1])) {
            found = true;
            if (up > sum[i]) {
              sum[i] = up;
              sum[i - 1] = down;
            }
          }
        }
      }
    if (!found) {
      cout << "No";
      return;
    }
  }
  for (int i = n; i > 0; --i) sum[i] -= sum[i - 1];
  cout << "Yes\n";
  for (int i = 1; i <= n; ++i) cout << sum[i] << ' ';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  const bool multiple_test = false;
  int test = 1;
  if (multiple_test) cin >> test;
  for (int i = 0; i < test; ++i) {
    solve();
  }
}
