#include <bits/stdc++.h>
int n;
int cnt = -1;
int first[600007], next_[600007 << 1], to[600007 << 1];
bool delet[600007 << 1];
int cur[600007];
int color[600007];
void add(int a, int b) {
  ++cnt;
  next_[cnt] = first[a];
  first[a] = cnt;
  to[cnt] = b;
}
void add_e(int a, int b) {
  add(a, b);
  add(b, a);
}
void dfs(int x) {
  for (int &i = first[x]; i != -1; i = next_[i]) {
    if (delet[i]) continue;
    int v = to[i];
    cur[x] = i;
    if (!color[(i >> 1) + 1]) {
      delet[i] = true;
      delet[i ^ 1] = true;
      color[(i >> 1) + 1] = (x < 200007) + 1;
      dfs(v);
    }
  }
}
int d[600007];
int main() {
  memset(first, -1, sizeof(first));
  memset(next_, -1, sizeof(next_));
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    ++d[a];
    ++d[b + 200007];
    add_e(a, b + 200007);
  }
  for (int i = 1; i <= 200007; ++i) {
    if (d[i] & 1) add_e(i, 200007 + 200007 + 1), ++d[200007 + 200007 + 1];
  }
  for (int i = 200007 + 1; i <= 200007 + 200007; ++i) {
    if (d[i] & 1) add_e(0, i), ++d[0];
  }
  if (d[0] & 1) add_e(0, 200007 + 200007 + 1);
  for (int i = 1; i <= 200007 + 200007; ++i) dfs(i);
  for (int i = 1; i <= n; ++i) {
    if (color[i] == 1)
      putchar('r');
    else
      putchar('b');
  }
  return 0;
}
