#include <bits/stdc++.h>
using namespace std;
const int maxn = 100500;
const int maxm = 1000000;
int gr[maxm + 5];
int sqrt4(long long n) {
  int l = 0, r = 1000;
  while (l < r) {
    int m = (l + r) >> 1;
    long long m2 = (1ll * m * m);
    long long m4 = m2 * m2;
    if (m4 < n) {
      l = m + 1;
    } else {
      r = m;
    }
  }
  return l;
}
int sqrt2(long long n) {
  int l = 0, r = 1000000;
  while (l < r) {
    int m = (l + r) >> 1;
    long long m2 = (1ll * m * m);
    if (m2 < n) {
      l = m + 1;
    } else {
      r = m;
    }
  }
  if (1ll * l * l > n) --l;
  return l;
}
void precalc() {
  int f[5] = {};
  int cmax = 0;
  for (int k = 4; k <= 60000; ++k) {
    int s4 = sqrt4(k), s2 = sqrt2(k);
    for (int i = s4; i <= s2; ++i) {
      f[gr[i]] = k;
    }
    int cgr = 0;
    while (f[cgr] == k) ++cgr;
    gr[k] = cgr;
    if (cgr > cmax) cmax = cgr;
  }
  for (int k = 60000; k <= maxm; ++k) {
    gr[k] = 1;
  }
}
int calc_gr(long long n) {
  if (n < maxm) {
    return gr[n];
  }
  if (n < 2562991876ll)
    return 1;
  else
    return 2;
  bool f[6] = {};
  int l = sqrt4(n), r = sqrt2(n);
  for (int i = l; i <= r; ++i) {
    f[gr[i]] = true;
  }
  int cur = 0;
  while (f[cur]) ++cur;
  return cur;
}
int main(int argc, char **argv) {
  int n;
  precalc();
  scanf("%d", &n);
  int sum = 0;
  for (int i = 0; i < n; ++i) {
    long long x;
    scanf("%I64d", &x);
    sum ^= calc_gr(x);
  }
  if (sum)
    printf("Furlo\n");
  else
    printf("Rublo\n");
  return 0;
}
