func_code_string: #include <bits/stdc++.h>   using namespace std;   vector<int> ans;   void solve() {     long long int i, a, b, c, d, n;     cin >> a >> b >> c >> d;     n = a + b + c + d;     string s =   ;     while (a > 0) {       s +=  0 ;       a--;     }     while (c > 0) {       s +=  2 ;       c--;     }     i = 0;     while (b > 0 && i < s.length()) {       if (s[i] ==  0 ) {         s.insert(i + 1, 1,  1 );         b--;       } else {         break;       }       i = i + 2;     }     while (d > 0 && i < s.length()) {       if (s[i] ==  2 ) {         s.insert(i + 1, 1,  3 );         d--;       }       i = i + 2;     }     while (b > 0 && i < s.length()) {       if (s[i] ==  2 ) {         s.insert(i + 1, 1,  1 );         b--;       }       i = i + 2;     }     if (d > 0 && s[0] ==  2 ) {       s.insert(0, 1,  3 );       d--;     }     if (b > 0 && (s[0] ==  0  || s[0] ==  2 )) {       s.insert(0, 1,  1 );       b--;     }     if (b > 0 && (s[s.length() - 1] ==  0  || s[s.length() - 1] ==  2 )) {       s.insert(s.length() - 1, 1,  1 );       b--;     }     while (b > 0) {       s +=  1 ;       b--;     }     while (d > 0) {       s +=  3 ;       d--;     }     for (i = 1; i < n; i++) {       if (abs(s[i] - s[i - 1]) != 1) {         cout <<  NO ;         return;       }     }     cout <<  YES n ;     for (i = 0; i < n; i++) cout << s[i] <<    ;   }   int main() {     long long int t;     t = 1;     while (t--) {       solve();       cout <<   n ;     }   }   