#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
const int M = N << 1;
int n, x[N], y[N], vis[N], Sta[M], top, ans[M << 1];
int last[N], to[M], Next[M], d[N], tot = 1;
void dfs(int u) {
  for (int &i = last[u]; i; i = Next[i]) {
    if (vis[i >> 1]) continue;
    vis[i >> 1] = true;
    int Record = i >> 1;
    dfs(to[i]), Sta[++top] = Record;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d %d", &x[i], &y[i]);
    y[i] += (N >> 1), d[x[i]]++, d[y[i]]++;
    to[++tot] = y[i], Next[tot] = last[x[i]], last[x[i]] = tot;
    to[++tot] = x[i], Next[tot] = last[y[i]], last[y[i]] = tot;
  }
  for (int i = 1; i < N; i++)
    if (d[i] & 1) {
      to[++tot] = i, Next[tot] = last[0], last[0] = tot;
      to[++tot] = 0, Next[tot] = last[i], last[i] = tot;
    }
  for (int i = 0; i < (N >> 1); i++) dfs(i);
  for (int i = 1; i <= top; i++) ans[Sta[i]] = i & 1;
  for (int i = 1; i <= n; i++) ans[i] ? putchar('b') : putchar('r');
  return 0;
}
