B"There are n stone quarries in Petrograd. Each quarry owns mi dumpers (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n). It is known that the first dumper of the i-th quarry has xi stones in it, the second dumper has xi xe2 x80 x89+ xe2 x80 x891 stones in it, the third has xi xe2 x80 x89+ xe2 x80 x892, and the mi-th dumper (the last for the i-th quarry) has xi xe2 x80 x89+ xe2 x80 x89mi xe2 x80 x89- xe2 x80 x891 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 xc2 xabtolik xc2 xbb and the other one xc2 xabbolik xc2 xbb. The first line of the input contains one integer number n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the amount of quarries. Then there follow n lines, each of them contains two space-separated integers xi and mi (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89xi, xe2 x80 x89mi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891016) -- the amount of stones in the first dumper of the i-th quarry and the number of dumpers at the i-th quarry. Output xc2 xabtolik xc2 xbb if the oligarch who takes a stone first wins, and xc2 xabbolik xc2 xbb otherwise."...