func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 1e2 + 7;   const long long mod = 1e9 + 7;   int a[N];   int main() {     int n;     cin >> n;     for (int i = (1); i < (n + 1); ++i) scanf( %d , a + i);     sort(a + 1, a + 1 + n);     if (n == 0) {       cout <<  YES n1 n1 n3 n3 n ;     } else if (n == 1) {       printf( YES n%d n%d n%d , a[1], 3 * a[1], 3 * a[1]);     } else if (n == 2) {       a[3] = 4 * a[1] - a[2];       a[4] = a[2] + a[3] - a[1];       if (a[3] < a[1] || a[4] < a[2] || a[4] < a[3]) {         cout <<  NO ;         return 0;       }       printf( YES n%d n%d , a[3], a[4]);     } else if (n == 3) {       a[4] = a[2] + a[3] - a[1];       if (2 * (a[4] - a[1]) == a[2] + a[3]) {         printf( YES n%d , a[4]);         return 0;       }       a[4] = a[1] + a[3] - a[2];       if (2 * (a[3] - a[1]) == a[2] + a[4]) {         printf( YES n%d , a[4]);         return 0;       }       a[4] = a[1] + a[2] - a[3];       if (2 * (a[3] - a[4]) == a[1] + a[2]) {         printf( YES n%d , a[4]);         return 0;       }       cout <<  NO ;     } else if (n == 4) {       if (2 * (a[2] + a[3]) == (a[1] + a[2] + a[3] + a[4]) &&           (a[2] + a[3]) == 2 * (a[4] - a[1]))         cout <<  YES  << endl;       else         cout <<  NO ;     }   }   