#include <bits/stdc++.h>
using namespace std;
int n, a[4], b[4];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  sort(a, a + n);
  if (!n)
    puts("YES\n1\n1\n3\n3");
  else if (n == 1)
    printf("YES\n%d\n%d\n%d\n", a[0] << 1, a[0] << 1, a[0] + (a[0] << 1));
  else if (n == 2) {
    if (a[0] * 3 == a[1])
      printf("YES\n%d\n%d\n", a[0] << 1, a[0] << 1);
    else if (a[1] < a[0] * 3)
      printf("YES\n%d\n%d\n", a[0] * 3, a[0] * 4 - a[1]);
    else
      puts("NO");
  } else if (n == 4) {
    if (a[0] + a[3] == a[1] + a[2] && (a[3] - a[0]) << 1 == a[1] + a[2])
      puts("YES");
    else
      puts("NO");
  } else {
    int i;
    for (i = 1; i <= 1000000; ++i) {
      for (int j = 0; j < 3; ++j) b[j] = a[j];
      b[3] = i;
      sort(b, b + 4);
      if (b[0] + b[3] == b[1] + b[2] && (b[3] - b[0]) << 1 == b[1] + b[2])
        break;
    }
    if (i <= 1000000)
      printf("YES\n%d\n", i);
    else
      puts("NO");
  }
  return 0;
}
