#include <bits/stdc++.h>
using namespace std;
struct ed {
  int a[2], dir;
};
vector<ed> e;
vector<int> gr[2][200002];
int l[2][200002], q[2][200002];
void solve(int v, int p, int r = 0, int q = 0) {
  for (int& i = l[p][v]; i < gr[p][v].size();) {
    if (e[gr[p][v][i]].dir == -1) {
      int x = e[gr[p][v][i]].a[1 - p];
      e[gr[p][v][i++]].dir = r;
      r = 1 - r;
      solve(x, 1 - p, r, 1);
      if (q) return;
    } else {
      i++;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    gr[0][a].push_back(e.size());
    gr[1][b].push_back(e.size());
    e.push_back({{a, b}, -1});
  }
  for (int i = 1; i < 200002; ++i) {
    solve(i, 0);
  }
  for (auto& x : e) {
    cout << "br"[x.dir];
  }
  return 0;
}
