Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Mike and Fish

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAs everyone knows, bears love fish. But Mike is a strange bear; He hates fish! The even more strange thing about him is he has an infinite number of blue and red fish.

He has marked *n* distinct points in the plane. *i*-th point is point (*x*_{i}, *y*_{i}). He wants to put exactly one fish in each of these points such that the difference between the number of red fish and the blue fish on each horizontal or vertical line is at most 1.

He can't find a way to perform that! Please help him.

Input

The first line of input contains integer *n* (1 ≤ *n* ≤ 2 × 10^{5}).

The next *n* lines contain the information about the points, *i*-th line contains two integers *x*_{i} and *y*_{i} (1 ≤ *x*_{i}, *y*_{i} ≤ 2 × 10^{5}), the *i*-th point coordinates.

It is guaranteed that there is at least one valid answer.

Output

Print the answer as a sequence of *n* characters 'r' (for red) or 'b' (for blue) where *i*-th character denotes the color of the fish in the *i*-th point.

Examples

Input

4

1 1

1 2

2 1

2 2

Output

brrb

Input

3

1 1

1 2

2 1

Output

brr

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/19/2019 09:42:46 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|