#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;   int A[5];   int check() {     vector<int> B(4);     for (int(i) = 1, j1234 = 4; (i) <= j1234; (i)++) B[i - 1] = A[i];     sort(B.begin(), B.end());     int x1 = B[0] + B[1] + B[2] + B[3];     int x2 = 2 * (B[1] + B[2]);     int x3 = 4 * (B[3] - B[0]);     return x1 == x2 && x2 == x3;   }   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)++) cin >> A[i];     if (N == 0) {       cout <<  YES  <<   n ;       cout << 1 <<   n ;       cout << 1 <<   n ;       cout << 3 <<   n ;       cout << 3 <<   n ;       return 0;     }     if (N == 1) {       int a = A[1];       cout <<  YES  <<   n ;       cout << a <<   n ;       cout << 3 * a <<   n ;       cout << 3 * a <<   n ;       return 0;     }     if (N == 2) {       for (int(x) = 1, j1234 = 1500; (x) <= j1234; (x)++)         for (int(y) = 1, j1234 = 1500; (y) <= j1234; (y)++) {           A[3] = x;           A[4] = y;           if (check()) {             cout <<  YES  <<   n ;             cout << x <<   n ;             cout << y <<   n ;             return 0;           }         }       cout <<  NO  <<   n ;       return 0;     }     if (N == 3) {       for (int(i) = 1, j1234 = 1500; (i) <= j1234; (i)++) {         A[4] = i;         if (check()) {           cout <<  YES  <<   n ;           cout << i <<   n ;           return 0;         }       }       cout <<  NO  <<   n ;       return 0;     }     if (N == 4) {       if (check()) {         cout <<  YES  <<   n ;       } else {         cout <<  NO  <<   n ;       }       return 0;     }   }   