#include <bits/stdc++.h>
using namespace std;
long long abs(long long, long long);
void solve() {
  string s;
  cin >> s;
  long long a[5][5];
  long long n = s.length();
  long long b[n][2];
  for (long long i = 1; i < 5; i++) {
    for (long long j = 1; j < 5; j++) a[i][j] = -1;
  }
  map<long long, long long> m;
  for (long long i = 0; i < n; i++) {
    if (s[i] == '0') {
      m[0]++;
      if (m[0] % 2 == 0) {
        b[i][0] = 3;
        b[i][1] = 1;
      } else {
        b[i][0] = 1;
        b[i][1] = 1;
      }
    } else {
      m[1]++;
      if (m[1] % 4 == 1) {
        b[i][0] = 1;
        b[i][1] = 3;
      } else if (m[1] % 4 == 2) {
        b[i][0] = 2;
        b[i][1] = 3;
      } else if (m[1] % 4 == 3) {
        b[i][0] = 3;
        b[i][1] = 3;
      } else if (m[1] % 4 == 0) {
        b[i][0] = 4;
        b[i][1] = 3;
      }
    }
  }
  for (long long i = 0; i < n; i++) {
    cout << b[i][0] << " " << b[i][1] << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long TESTS = 1;
  while (TESTS--) {
    solve();
  }
  return 0;
}
long long abs(long long a, long long b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
