func_code_string: #include <bits/stdc++.h>   using namespace std;   int isP(long int hj) {     long int op;     for (op = 2; op <= sqrt(hj); op++) {       if (hj % op == 0) return 0;     }     return 1;   }   void swap(long long int *p, long long int *q) {     long long int tmp = *p;     *p = *q;     *q = tmp;   }   void tog(int *p) {     if (*p == 1)       *p = 0;     else       *p = 1;   }   string fdi(int hi) {     switch (hi) {       case 0:         return  zero ;       case 1:         return  one ;       case 2:         return  two ;       case 3:         return  three ;       case 4:         return  four ;       case 5:         return  five ;       case 6:         return  six ;       case 7:         return  seven ;       case 8:         return  eight ;       case 9:         return  nine ;     }   }   string rdx(int hi) {     switch (hi) {       case 2:         return  twenty ;       case 3:         return  thirty ;       case 4:         return  forty ;       case 5:         return  fifty ;       case 6:         return  sixty ;       case 7:         return  seventy ;       case 8:         return  eighty ;       case 9:         return  ninety ;     }   }   long long int bd(long long int mk, long long int nk) {     long long int i;     for (i = min(mk, nk); i >= 1; i--) {       if (mk % i == 0 && nk % i == 0) return i;     }   }   int dsm(long long int pkk) {     if (pkk < 0) pkk *= -1;     while (pkk > 0) {       if (pkk % 10 == 8) return 1;       pkk /= 10;     }     return 0;   }   int main() {     long long int nk, l, nl, np, odI, evI, r, a1, a2, amt, maxu, y3, sx, sy, bsm,         fsm, bu, cp, bf, pr, res, lastm, c, r1, r2, x1, x2, y1, y2, maxN, m1, m2,         prev, prc, cost, ind, ans, g, p, inc, cap, sm, d, nxt, mn, t, up, a, b,         lc, la, e, preI, t2, brk, clbp, clb, et, jmp, u, l1, l2, sq, nd, maxi, li,         ri, tr, mp, og, lt1, lt2, n1, n2, c1, c2, minI, min1, p2, p3, ze, fst,         lst, min2, s, sm1, sm2, sm3, sr, sl, ln, rz, rn, car, eq, shr, ng, v,         curr, spl, fl, z, ev, od, m, ct, j, q, k, maxI, max1, max2, lt, md, f, n,         xP, xN, w, h, d2, d1, u1, u2, i, x, y;     cin >> n;     string st;     cin >> st;     a = 0;     b = 0;     if (st[0] ==  a )       a++;     else       b++;     ct = 0;     for (i = 1; i < n; i++) {       if (i % 2 != 0) {         if (st[i] ==  a )           a++;         else           b++;         if (a != b) {           ct++;           if (st[i] ==  a ) {             st[i] =  b ;             a--;             b++;           } else {             st[i] =  a ;             a++;             b--;           }         }       } else {         if (st[i] ==  a )           a++;         else           b++;       }     }     cout << ct << endl;     cout << st;     return 0;   }   