#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const double pi = acos(-1.0);
const double inf = 1e100;
template <class T>
inline T read() {
  T x = 0, f = 1;
  char s = getchar();
  while (s < '0' || s > '9') {
    if (s == '-') f = -1;
    s = getchar();
  };
  while (s >= '0' && s <= '9') {
    x = (x << 3) + (x << 1) + s - 48;
    s = getchar();
  };
  return x * f;
}
template <typename T>
inline void wri(T x) {
  if (x < 0) {
    x = -x;
    putchar('-');
  };
  if (x / 10) wri(x / 10);
  putchar(x % 10 + 48);
}
template <typename T>
inline void print(T x, char s) {
  wri(x);
  putchar(s);
}
template <typename T>
T gcd(T a, T b) {
  return b == 0 ? a : gcd(b, a % b);
}
int n;
long long s, e;
int f[100010], g[100010], a[100010], b[100010];
int get(long long s, long long e) {
  if (2 * s > e) {
    return 1;
  } else {
    e /= 2;
    if (e & 1) {
      return (e - s) & 1;
    } else if (2 * s > e) {
      return (e - s) & 1;
    } else {
      return get(s, e / 2);
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n;
  for (auto i = (0); i < (n); i++) {
    cin >> s >> e;
    f[i] = get(s, 2 * e);
    g[i] = get(s, e);
  }
  b[0] = 1;
  for (int i = 0; i < n; i++) {
    a[i + 1] = f[i] ? b[i] : a[i];
    b[i + 1] = g[i] ? b[i] : a[i];
  }
  cout << a[n] << " " << b[n] << endl;
  return 0;
}
