#include <bits/stdc++.h>
using namespace std;
int n, box[4], test[4], p0, p1, p2;
double prom, median, range;
bool flag[4];
void print_0() {
  cout << "YES" << endl;
  cout << 1 << endl << 1 << endl << 3 << endl << 3 << endl;
}
void print_4() {
  prom = (box[0] + box[1] + box[2] + box[3]) / (double)4;
  median = (box[1] + box[2]) / (double)2;
  range = box[3] - box[0];
  if (prom == median && median == range) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
bool check_test() {
  if (test[0] > 0 && test[1] >= test[0] && test[2] >= test[1] &&
      test[3] >= test[2]) {
    prom = (test[0] + test[1] + test[2] + test[3]) / (double)4;
    return prom == range;
  }
  return false;
}
int pos(int value) {
  for (int i = 0; i < 4; i++) {
    if (!flag[i] && test[i] == value) {
      flag[i] = true;
      return i;
    }
  }
  return -1;
}
bool found() {
  flag[0] = flag[1] = flag[2] = flag[3] = 0;
  if (n == 1) {
    p0 = pos(box[0]);
    if (p0 != -1) {
      cout << "YES" << endl;
      for (int i = 0; i < 4; i++) {
        if (i != p0) cout << test[i] << endl;
      }
      return true;
    }
    return false;
  } else if (n == 2) {
    p0 = pos(box[0]);
    p1 = pos(box[1]);
    if (p0 != -1 && p1 != -1) {
      cout << "YES" << endl;
      for (int i = 0; i < 4; i++) {
        if (i != p0 && i != p1) cout << test[i] << endl;
      }
      return true;
    }
    return false;
  } else if (n == 3) {
    p0 = pos(box[0]);
    p1 = pos(box[1]);
    p2 = pos(box[2]);
    if (p0 != -1 && p1 != -1 && p2 != -1) {
      cout << "YES" << endl;
      for (int i = 0; i < 4; i++) {
        if (i != p0 && i != p1 && i != p2) cout << test[i] << endl;
      }
      return true;
    }
    return false;
  }
  return false;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> box[i];
  }
  sort(box, box + n);
  if (n == 0)
    print_0();
  else if (n == 4)
    print_4();
  else {
    bool ok = false;
    for (int i = 1; i <= 500 && !ok; i++) {
      test[0] = i;
      test[3] = 3 * i;
      range = test[3] - test[0];
      for (int j = i; j <= 1500 && !ok; j++) {
        test[1] = j;
        test[2] = 2 * range - j;
        if (check_test() && found()) {
          ok = true;
        }
      }
    }
    if (!ok) {
      cout << "NO" << endl;
    }
  }
  return 0;
}
