#include <bits/stdc++.h>   #pragma GCC optimize  03    using namespace std;   const int N = 1e5 + 5;   const int mod = 1e9 + 7;   const int inf = 1e9 + 9;   pair<int, int> ans[1004];   signed main() {     ios::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     string s;     cin >> s;     int c1 = 0, c2 = 0;     for (int i = 0; i < s.length(); i++) {       if (s[i] ==  0 ) {         if (c1 == 0) {           c1 = 1;           ans[i].first = 3, ans[i].second = 1;         } else {           c1 = 0;           ans[i].first = 1, ans[i].second = 1;         }       } else {         if (c2 == 0) {           c2 = 1;           ans[i].first = 1, ans[i].second = 3;         } else {           c2 = 0;           ans[i].first = 1, ans[i].second = 1;         }       }     }     for (int i = 0; i < s.length(); i++)       cout << ans[i].first <<     << ans[i].second <<   n ;     return 0;   }   