#include <bits/stdc++.h>
using namespace std;
const int maxn = 80010, maxs = 890010, maxc = 890000;
int n;
long long dat[maxn];
int f[maxs];
int c[maxs], mark[maxs];
long long sqr(long long x) { return x * x; }
void insertunit(int pos, int x) {
  pos++;
  for (; pos < maxs; pos += pos & (-pos)) c[pos] += x;
}
int querysum(int pos) {
  pos++;
  int ans = 0;
  for (; pos; pos -= pos & (-pos)) ans += c[pos];
  return ans;
}
int querysmall() {
  if (querysum(0) < 1) return 0;
  int left = 0, right = maxs - 2;
  while (left + 1 < right) {
    int mid = (left + right) / 2;
    if (querysum(mid) < mid + 1)
      right = mid;
    else
      left = mid;
  }
  return right;
}
void precalc() {
  int left = 2, right = 2;
  for (int i = 1; i <= 3; i++) f[i] = 0;
  for (int i = 4; i < maxc; i++) {
    while (sqr(sqr(left)) < i) {
      if ((--mark[f[left]]) == 0) insertunit(f[left], -1);
      left++;
    }
    while (sqr(right) <= i) {
      if (mark[f[right]] == 0) insertunit(f[right], 1);
      mark[f[right]]++;
      right++;
    }
    f[i] = querysmall();
  }
}
int getf() {
  int ans = 0;
  memset(c, 0, sizeof(c));
  memset(mark, 0, sizeof(mark));
  int left = 2, right;
  int i;
  for (i = 0; i < n; i++)
    if (dat[i] >= 4) break;
  while (sqr(sqr(left)) < dat[i]) left++;
  right = left;
  for (; i < n; i++) {
    while (sqr(sqr(left)) < dat[i]) {
      if ((--mark[f[left]]) == 0) insertunit(f[left], -1);
      left++;
    }
    while (sqr(right) <= dat[i]) {
      if (mark[f[right]] == 0) insertunit(f[right], 1);
      mark[f[right]]++;
      right++;
    }
    ans ^= querysmall();
  }
  return ans;
}
int main() {
  precalc();
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%I64d", &dat[i]);
  sort(dat, dat + n);
  if (getf() == 0)
    printf("Rublo\n");
  else
    printf("Furlo\n");
  return 0;
}
