#include <bits/stdc++.h>
const int N = 200000;
int ds[N * 2 + 10], deg[N * 2 + 10], x[N * 2 + 10], next[N * 2 + 10],
    sh[N * 2 + 10];
bool canh[N + 10], kq[N + 10];
void dfs1(int u, bool color) {
  while (ds[u] != -1) {
    if (canh[sh[ds[u]]]) {
      canh[sh[ds[u]]] = false;
      deg[u]--;
      deg[x[ds[u]]]--;
      kq[sh[ds[u]]] = color;
      dfs1(x[ds[u]], !color);
      break;
    }
    ds[u] = next[ds[u]];
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= N * 2; i++) {
    ds[i] = -1;
    deg[i] = 0;
  }
  int m = 0;
  for (int i = 0; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    v += N;
    x[m] = v;
    sh[m] = i;
    next[m] = ds[u];
    ds[u] = m++;
    x[m] = u;
    sh[m] = i;
    next[m] = ds[v];
    ds[v] = m++;
    deg[u]++;
    deg[v]++;
    canh[i] = true;
  }
  for (int i = 1; i <= N * 2; i++)
    if (deg[i] & 1) {
      dfs1(i, true);
    }
  for (int i = 1; i <= N * 2; i++)
    while (deg[i] > 0) dfs1(i, true);
  for (int i = 0; i < n; i++) printf("%c", kq[i] ? 'r' : 'b');
  return 0;
}
