#include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX;
const long long INFL = LLONG_MAX;
const int output_precision = 15;
const long double pi = acos(-1);
const bool debug = true;
int N;
vector<int> a;
int check() {
  vector<int> b;
  for (int(i) = 0, j1234 = 4; (i) < j1234; (i)++) b.push_back(a[i]);
  sort(b.begin(), b.end());
  int tot = 0;
  for (int(i) = 0, j1234 = 4; (i) < j1234; (i)++) tot += b[i];
  int x1 = tot;
  tot = b[1] + b[2];
  int x2 = tot * 2;
  int x3 = 4 * (b[3] - b[0]);
  return x1 == x2 && x2 == x3;
}
int finish(int a3, int a4) {
  cout << "YES" << '\n';
  cout << a3 << '\n';
  cout << a4 << '\n';
  exit(0);
}
int solve2() {
  a.push_back(0);
  a.push_back(0);
  for (int(x) = 1, j1234 = 1500; (x) <= j1234; (x)++)
    for (int(y) = 1, j1234 = x; (y) <= j1234; (y)++) {
      a[2] = x;
      a[3] = y;
      if (check()) {
        cout << "YES" << '\n';
        cout << x << '\n';
        cout << y << '\n';
        return 0;
      }
    }
  cout << "NO" << '\n';
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.precision(output_precision);
  cout << fixed;
  cout.tie(0);
  cin >> N;
  for (int(i) = 1, j1234 = N; (i) <= j1234; (i)++) {
    int foo;
    cin >> foo;
    a.push_back(foo);
  }
  if (N) sort(a.begin(), a.end());
  if (N == 0) {
    cout << "YES" << '\n';
    cout << 1 << '\n';
    cout << 1 << '\n';
    cout << 3 << '\n';
    cout << 3 << '\n';
    return 0;
  } else if (N == 1) {
    cout << "YES" << '\n';
    cout << a[0] << '\n';
    cout << 3 * a[0] << '\n';
    cout << 3 * a[0] << '\n';
    return 0;
  } else if (N == 2) {
    solve2();
    return 0;
  } else if (N == 3) {
    a.push_back(0);
    for (int(i) = 1, j1234 = 1e6; (i) <= j1234; (i)++) {
      a[3] = i;
      if (check()) {
        cout << "YES" << '\n';
        cout << i << '\n';
        return 0;
      }
    }
    cout << "NO" << '\n';
    return 0;
  } else if (N == 4) {
    cout << (check() ? "YES" : "NO") << '\n';
    return 0;
  }
}
