#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 20;
int cnt[maxn * 2];
map<pair<int, int>, int> mark;
map<pair<int, int>, int> color;
vector<int> adj[2 * maxn];
stack<int> stk;
int deg[2 * maxn];
vector<pair<int, int> > E;
void dfs(int v) {
  for (int &i = cnt[v]; i < adj[v].size(); i++) {
    int u = adj[v][i];
    if (!mark[{v, u}]) {
      mark[{v, u}] = 1;
      mark[{u, v}] = 1;
      dfs(u);
    }
  }
  stk.push(v);
}
void solve() {
  for (int i = 0; i < maxn * 2; i++) {
    dfs(i);
    if (!stk.empty()) {
      int last = stk.top();
      stk.pop();
      int C = 0;
      while (!stk.empty()) {
        int u = stk.top();
        stk.pop();
        color[{last, u}] = C + 1;
        color[{u, last}] = C + 1;
        C = 1 - C;
        last = u;
      }
    }
  }
}
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 x, y;
    cin >> x >> y;
    y += maxn;
    E.push_back({x, y});
    adj[x].push_back(y);
    adj[y].push_back(x);
    deg[x]++;
    deg[y]++;
  }
  for (int i = 1; i < maxn; i++) {
    if (deg[i] % 2) {
      adj[0].push_back(i);
      adj[i].push_back(0);
    }
  }
  for (int i = maxn + 1; i < maxn * 2; i++) {
    if (deg[i] % 2) {
      adj[maxn].push_back(i);
      adj[i].push_back(maxn);
    }
  }
  if (deg[0] % 2) {
    adj[0].push_back(maxn);
    adj[maxn].push_back(0);
  }
  solve();
  for (pair<int, int> p : E) {
    if (color[p] == 1) {
      cout << 'b';
      continue;
    }
    if (color[p] == 2) {
      cout << 'r';
      continue;
    }
    cout << "no";
  }
  return 0;
}
