As 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*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>). 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.
The first line of input contains integer *n* (1 ≤ *n* ≤ 2 × 10<sup class="upper-index">5</sup>).

The next *n* lines contain the information about the points, *i*-th line contains two integers *x*<sub class="lower-index">*i*</sub> and *y*<sub class="lower-index">*i*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> ≤ 2 × 10<sup class="upper-index">5</sup>), the *i*-th point coordinates.

It is guaranteed that there is at least one valid answer.
time = 0

def dfs(node: int, graph):

    stack = []
    global time
    col=0
    stack.append((node,-1))
    pi[node]=node
    while stack:
        s,ind = stack.pop()
        if d[s] == -1:
            if ind>-1:
                colour[ind]=col
                col=col^1
            d[s] = time
            time += 1
            stack.append((s,ind))

            for v, i in graph[s]:
                if d[v] == -1:
                    pi[v]=s
                    stack.append((v,i))
                else:
                    if pi[s]!=v:
                       colour[i]=col
                       pass
                    
        elif f[s] == -1:
            f[s] = time
            time += 1
            
c=2*10**5
n=4*10**5

from sys import stdin,stdout

m = int(stdin.readline())
graph = [[] for _ in range(n)]
for i in range(m):
    u, v = stdin.readline.split()
    u, v = (int(u)-1, int(v)-1 + c)
    graph[u].append((v, i))
    graph[v].append((u, i))

global d
d = [-1]*n
global f
f = [-1]*n
global pi 
pi=[-1]*n
global colour
colour = [0]*m
global time
time = 0

order=[i for i in range(n) if len(graph[i])%2]
for i in range(n):
    if len(graph[i]):
        if len(graph[i])%2==0:
            order.append(i)

for i in order:
    if d[i] == -1:
        dfs(i, graph)

sol=''.join(['b' if i==1 else 'r' for i in colour])

stdout.write(sol)
