#include <bits/stdc++.h>
using namespace std;
const int MAX_BUF_SIZE = 16384;
char BUFOR[MAX_BUF_SIZE];
int BUF_SIZE, BUF_POS;
char ZZZ;
const int MXN = 200010;
const int C = 200000;
const int INF = 1000000001;
int n;
int x[MXN], y[MXN];
pair<int, int> s[MXN];
int ss;
vector<int> G[2 * MXN];
set<int> P, N;
int rem[2 * MXN];
set<pair<int, int> > removed;
int r[2 * MXN], b[2 * MXN];
map<pair<int, int>, char> ans;
void change(int x) {
  if (P.find(x) != P.end()) {
    P.erase(x);
    N.insert(x);
  } else {
    N.erase(x);
    P.insert(x);
  }
}
int vis[2 * MXN];
char last = 'r';
void dfs(int x) {
  while ((int)(G[x]).size() &&
         removed.find(make_pair(min(x, G[x].back()), max(x, G[x].back()))) !=
             removed.end())
    G[x].pop_back();
  if ((int)(G[x]).size() == 0) return;
  int y = G[x].back();
  if (last == 'r') {
    ans[make_pair(min(x, y), max(x, y) - C)] = 'b';
    last = 'b';
  } else {
    ans[make_pair(min(x, y), max(x, y) - C)] = 'r';
    last = 'r';
  }
  removed.insert(make_pair(min(x, y), max(x, y)));
  dfs(y);
}
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (n); i++) {
    scanf("%d %d", &x[i], &y[i]);
    G[x[i]].push_back(y[i] + C);
    G[y[i] + C].push_back(x[i]);
  }
  for (int i = (1); i <= (2 * C); i++) {
    if ((int)(G[i]).size()) {
      if ((int)(G[i]).size() % 2 == 0)
        P.insert(i);
      else
        N.insert(i);
    }
  }
  while ((int)(N).size()) {
    int v = (*N.begin());
    int u;
    while (1) {
      u = G[v].back();
      G[v].pop_back();
      if (removed.find(make_pair(min(u, v), max(u, v))) == removed.end()) {
        removed.insert(make_pair(min(u, v), max(u, v)));
        break;
      }
    }
    change(v);
    change(u);
    s[ss++] = make_pair(v, u);
  }
  for (int i = (1); i <= (2 * MXN - 1); i++) dfs(i);
  for (int i = (ss - 1); i >= (0); i--) {
    int s1 = s[i].first;
    int s2 = s[i].second;
    char z;
    if (r[s2] > b[s2]) {
      b[s2]++;
      b[s1]++;
      z = 'b';
    } else {
      r[s1]++;
      r[s2]++;
      z = 'r';
    }
    if (s1 > s2) swap(s1, s2);
    ans[make_pair(s1, s2 - C)] = z;
  }
  for (int i = (1); i <= (n); i++) printf("%c", ans[make_pair(x[i], y[i])]);
  printf("\n");
  return 0;
}
