func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( Ofast )   #pragma GCC optimize( unroll-loops )   #pragma GCC target( avx,avx2,fma )   using namespace std;   const int N = 1500 + 5, lg = 27, mod = 5e4 + 7;   bool check(int a, int b, int c, int d) {     double k = 1.0 * (a + b + c + d) / 4;     double k1 = 1.0 * (b + c) / 2;     double k2 = d - a;     return k == k1 && k1 == k2 && a > 0 && b > 0 && c > 0 && d > 0;   }   void solve() {     int n;     cin >> n;     vector<int> v(4, 1e6 + 5);     for (int i = 0; i < n; i++) {       cin >> v[i];     }     sort(v.begin(), v.end());     if (!n) {       cout <<  YES n             <<  1 n1 n3 n3 ;     } else {       if (n == 4) {         if (check(v[0], v[1], v[2], v[3])) {           cout <<  YES n ;         } else {           cout <<  NO ;         }       } else if (n == 1) {         cout <<  YES n ;         int x = v[0];         cout << x <<   n  << 3 * x <<   n  << 3 * x;       } else if (n == 2) {         v[3] = v[0] * 3;         v[2] = v[0] * 4 - v[1];         if (check(v[0], v[1], v[2], v[3])) {           cout <<  YES n ;           cout << v[2] <<   n  << v[3];         } else {           cout <<  NO n ;         }       } else {         for (int i = 1; i < 1505; i++) {           vector<int> k = v;           k.push_back(i);           sort(k.begin(), k.end());           if (check(k[0], k[1], k[2], k[3])) {             cout <<  YES n ;             cout << i;             return;           }         }         cout <<  NO ;       }     }   }   int32_t main() {     ios::sync_with_stdio(0);     cin.tie(nullptr);     cout.tie(nullptr);     int testCases = 1;     while (testCases--) {       solve();     }   }   