#include <bits/stdc++.h>
using namespace std;
int n;
long long ans, first, second;
long long f(long long u) {
  u++;
  long long ret = 0, p = 1;
  while (p <= u) {
    long long cnt = u / (p + p) * p;
    if (u % (p + p) >= p) cnt += u % (p + p) - p;
    if (cnt & 1) ret += p;
    p = p + p;
  }
  return ret;
}
int main() {
  scanf("%d", &n);
  while (n--) {
    scanf("%lld%lld", &first, &second);
    ans ^= f(first - 1) ^ f(first + second - 1);
  }
  printf("%colik\n", ans ? 't' : 'b');
  return 0;
}
