#include <bits/stdc++.h>
#pragma comment(linker, "/stack:225450978")
#pragma GCC optimize("Ofast")
using namespace std;
const long long Mod = 1000000007LL, INF = 1e9, LINF = 1e18;
const long double Pi = 3.141592653589793116, EPS = 1e-9,
                  Gold = ((1 + sqrt(5)) / 2);
long long keymod[] = {1000000007LL, 1000000009LL, 1000000021LL, 1000000033LL};
long long keyCount = sizeof(keymod) / sizeof(long long);
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcountll(s);
}
auto TimeStart = chrono::steady_clock::now();
auto TimeEnd = chrono::steady_clock::now();
void ControlIO(int argc, char* argv[]);
void TimerStart();
void TimerStop();
void Exit();
string cppstr_infile = "FILE.IN";
string cppstr_outfile = "FILE.OUT";
long long n;
vector<long long> a;
void Input() {
  cin >> n;
  a.resize(n);
  for (auto& x : a) cin >> x;
}
void Solve() {
  if (n == 0) {
    cout << "YES\n2\n4\n4\n6\n";
    return;
  }
  if (n == 4) {
    sort(a.begin(), a.end());
    if (a[0] + a[1] + a[2] + a[3] == 2LL * (a[1] + a[2]) &&
        2LL * (a[1] + a[2]) == (a[3] - a[0]) * 4) {
      cout << "YES\n";
      return;
    }
    cout << "NO\n";
    return;
  }
  if (n == 3) {
    for (long long b = 1; b <= 1000000; b++) {
      a.push_back(b);
      sort(a.begin(), a.end());
      if (a[0] + a[1] + a[2] + a[3] == 2LL * (a[1] + a[2]) &&
          2LL * (a[1] + a[2]) == (a[3] - a[0]) * 4) {
        cout << "YES\n" << b << '\n';
        return;
      }
      a.erase(find(a.begin(), a.end(), b));
    }
    cout << "NO\n";
    return;
  }
  if (n == 1) {
    cout << "YES\n";
    cout << a[0] * 2 << '\n';
    cout << a[0] * 2 << '\n';
    cout << a[0] * 3 << '\n';
    return;
  }
  long long Mn = min(a[0], a[1]), Mx = max(a[0], a[1]);
  for (long long x = 1; x <= 500; x++) {
    for (long long y = 1; y <= 500; y++) {
      a.push_back(x);
      a.push_back(y);
      sort(a.begin(), a.end());
      if (a[0] + a[1] + a[2] + a[3] == 2LL * (a[1] + a[2]) &&
          2LL * (a[1] + a[2]) == (a[3] - a[0]) * 4) {
        cout << "YES\n" << x << '\n' << y << '\n';
        return;
      }
      a.erase(find(a.begin(), a.end(), x));
      a.erase(find(a.begin(), a.end(), y));
    }
  }
  for (long long x = 501; x <= 1000000; x++) {
    long long Rangex4 = (x + Mx) * 2;
    if (Rangex4 % 4 != 0) continue;
    long long y = Mn + Rangex4 / 4;
    if (x > y) continue;
    if (x + y + Mn + Mx == Rangex4) {
      cout << "YES\n" << x << '\n' << y << '\n';
      return;
    }
  }
  cout << "NO\n";
}
int main(int argc, char* argv[]) {
  ControlIO(argc, argv);
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  Input();
  TimerStart();
  Solve();
  TimerStop();
  return 0;
}
void ControlIO(int argc, char* argv[]) {
  char* infile = new char[cppstr_infile.size() + 1];
  char* outfile = new char[cppstr_outfile.size() + 1];
  strcpy(infile, cppstr_infile.c_str());
  strcpy(outfile, cppstr_outfile.c_str());
}
void TimerStart() {}
void TimerStop() {}
void Exit() {
  TimerStop();
  exit(0);
}
