Codeforces 15C Industrial Nim（Nim博弈）

C. Industrial Nim

time limit per test

2 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

There are n stone quarries in Petrograd.

Each quarry owns mi dumpers (1 ≤ i ≤ n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi + 1 stones in it, the third has xi + 2, and the mi-th dumper (the last for the i-th quarry) has xi + mi - 1 stones in it.

Two oligarchs play a well-known game Nim. Players take turns removing stones from dumpers. On each turn, a player can select any dumper and remove any non-zero amount of stones from it. The player who cannot take a stone loses.

Your task is to find out which oligarch will win, provided that both of them play optimally. The oligarchs asked you not to reveal their names. So, let's call the one who takes the first stone «tolik» and the other one «bolik».

Input

The first line of the input contains one integer number n (1 ≤ n ≤ 105) — the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 ≤ xi, mi ≤ 1016) — the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry.

Output

Output «tolik» if the oligarch who takes a stone first wins, and «bolik» otherwise.

Examples

input

Copy

2
2 1
3 2

output

tolik

input

Copy

4
1 1
1 1
1 1
1 1

output

bolik

题目链接： http://codeforces.com/problemset/problem/15/C

【题意】一共有n个采石场，第i个采石场有mi辆货车，第一辆货车上有xi个石子，第二辆车上有xi+1个石子......第mi辆车上有xi+mi-1个石子，两人轮流拿石子，拿石子的规则符合Nim博弈规则，最后没发取石子的人为输。

【思路】在异或运算中，2^3=1,4^5=1,6^7=1.....即n^(n+1)=1当且仅当n为偶数。

【代码如下】

#include <bits/stdc++.h>
#define LL long long
using namespace std;

int n;
const int N = 1e5+10;
LL ans=0;
struct node{
    LL x,m;
}p[N];

int main(){
    scanf("%d",&n);
    for(int i = 0; i < n; i ++) scanf("%I64d%I64d",&p[i].x,&p[i].m);
    for(int i = 0; i < n; i ++){
        if(p[i].x % 2 == 0){
            LL k = p[i].m/2;
            if(k%2) ans ^= 1;
            if(p[i].m%2) ans ^= (p[i].m+p[i].x-1);
        }
        else{
            ans ^= p[i].x;
            LL k = (p[i].m-1) / 2;
            if(k%2) ans ^= 1;
            if(p[i].m % 2 == 0) ans ^= (p[i].x + p[i].m - 1);
        }
    }
    printf("%s\n",ans? "tolik" : "bolik");
    return 0;
}