#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
void solve() {
  long long int i, j, k, l, n, m;
  string s;
  cin >> s;
  k = 1;
  l = 1;
  n = s.length();
  for (i = 0; i < n; i++) {
    if (s[i] == '0') {
      cout << 3 << " " << l << endl;
      l++;
      if (l == 5) l = 1;
    } else {
      cout << 1 << " " << k << endl;
      k += 2;
      if (k == 5) k = 1;
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int i, j, l, k, t, n;
  t = 1;
  while (t--) solve();
}
