#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long INF = 1e9, MOD = INF + 7;
long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); }
long long power(long long a, long long b) {
  return (!b ? 1 : power(a, b / 2) * power(a, b / 2) * (b % 2 ? a : 1));
}
long long mod(long long a) { return (a % MOD + MOD) % MOD; }
const long long N = 2e5 + 20;
int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  string s;
  cin >> s;
  long long x = 0, y = 0;
  for (long long i = 0; i < s.size(); i++) {
    if (s[i] == '0') {
      cout << 1 << " " << x + 1 << "\n";
      x = (x + 1) % 4;
    } else {
      cout << 3 << " " << y + 1 << "\n";
      y = (y + 2) % 4;
    }
  }
  return 0;
}
