#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 10);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
bool isPrime(long long N) {
  for (long long i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
long long cbrt(long long x) {
  long long lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
const long long nax = (long long)(100000 + 10);
long long countDeletions(string str) {
  long long ans = 0;
  for (long long i = 0; i < str.length() - 1; i++)
    if (str[i] == str[i + 1]) ans++;
  return ans;
}
long long a[4][4];
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  long long t = 1;
  while (t--) {
    string s;
    cin >> s;
    long long n = s.size();
    long long l = 0, u = 0;
    for (long long i = 0; i < n; i++) {
      if (s[i] == '1') {
        long long xx = l + 1;
        cout << 1 << ' ' << xx << "\n";
        l = (l + 2) % 4;
      } else {
        long long xx = u + 1;
        cout << 3 << ' ' << xx << "\n";
        u = (u + 1) % 4;
      }
    }
  }
  return 0;
}
