### Game!

Time Limit: 1000 ms Memory Limit: 65536 KiB

#### Problem Description

One day, zbybr is playing a game with blankcqk, here are the rules of the game:

There is a circle of N stones, zbybr and blankcqk take turns taking the stones.

Each time, one player can choose to take one stone or take two adjacent stones.

You should notice that if there are 4 stones, and zbybr takes the 2nd, the 1st and 3rd stones are still not adjacent.

The winner is the one who takes the last stone.

Now, the game begins and zbybr moves first.

If both of them will play with the best strategy, can you tell me who will win the game?

#### Input

The first line of input contains an integer T, indicating the number of test cases (T≈100000).

For each case, there is a positive integer N (N ≤ 10^18).

#### Output

Output the name of the winner.

#### Sample Input

2
1
2

#### Sample Output

zbybr
zbybr

#### Source

“浪潮杯”山东省第六届ACM大学生程序设计竞赛