#include <bits/stdc++.h>
using namespace std;
pair<int, int> _range(long long x) {
  long long l, r;
  long long rg = sqrt(x), lf = sqrt(rg);
  for (long long i = lf + 2; i >= lf; i--)
    if ((i * i * i * i) >= x) l = i;
  for (long long i = rg; i <= rg + 2; i++)
    if ((i * i) <= x) r = i;
  return {l, r};
}
long long mex[1000006], ara[1000006];
int freq[1000006];
int main() {
  mex[1] = 1;
  int L = 1, R = 0;
  for (int i = 2; i < 1000006; i++) {
    pair<int, int> p = _range(i);
    int l = p.first, r = p.second;
    while (R < r) freq[mex[R + 1]]++, R++;
    while (R > r) freq[mex[R]]--, R--;
    while (L < l) freq[mex[L]]--, L++;
    while (L > l) freq[mex[L - 1]]++, L--;
    while (freq[mex[i]]) mex[i]++;
  }
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld", &ara[i]);
  sort(ara, ara + n);
  memset(freq, 0, sizeof freq);
  L = 1, R = 0;
  int res = 0;
  for (int i = 0; i < n; i++) {
    pair<int, int> p = _range(ara[i]);
    int l = p.first, r = p.second;
    while (R < r) freq[mex[R + 1]]++, R++;
    while (R > r) freq[mex[R]]--, R--;
    while (L < l) freq[mex[L]]--, L++;
    while (L > l) freq[mex[L - 1]]++, L--;
    int m = 0;
    while (freq[m]) m++;
    res ^= m;
  }
  if (res)
    puts("Furlo");
  else
    puts("Rublo");
  return 0;
}
