#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int n;
long long a[100007];
int g[1000007];
int cnt[1007];
int t[4007];
void build(int v, int l, int r) {
  if (l == r) {
    cnt[l] = 0;
    t[v] = l;
    return;
  }
  int lr = (l + r) >> 1;
  build(v + v, l, lr);
  build(v + v + 1, lr + 1, r);
  t[v] = min(t[v + v], t[v + v + 1]);
}
void add(int v, int l, int r, int x, int delta) {
  if (l == r) {
    cnt[l] += delta;
    if (cnt[l] == 0)
      t[v] = x;
    else
      t[v] = 1000007;
    return;
  }
  int lr = (l + r) >> 1;
  if (x <= lr)
    add(v + v, l, lr, x, delta);
  else
    add(v + v + 1, lr + 1, r, x, delta);
  t[v] = min(t[v + v], t[v + v + 1]);
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  build(1, 0, 10);
  int l = 1, r = 0;
  for (int i = 3; i <= 1000000; i++) {
    while (r * r <= i) {
      add(1, 0, 10, g[++r], 1);
    }
    while (r * r > i) {
      add(1, 0, 10, g[r--], -1);
    }
    while (l * l * l * l < i) {
      add(1, 0, 10, g[l++], -1);
    }
    g[i] = t[1];
  }
  int ans = 0;
  long long L = l, R = r;
  for (int i = 0; i < n; i++) {
    long long x = a[i];
    if (x <= 1000000) {
      ans ^= g[x];
      continue;
    }
    while (R * R <= x) {
      add(1, 0, 10, g[++R], 1);
    }
    while (R * R > x) {
      add(1, 0, 10, g[R--], -1);
    }
    while (L * L * L * L < x) {
      add(1, 0, 10, g[L++], -1);
    }
    ans ^= t[1];
  }
  if (ans == 0)
    cout << "Rublo";
  else
    cout << "Furlo";
  return 0;
}
