#include <bits/stdc++.h>
using namespace std;
int s[3000005], ps[3000005][5];
int n, ans;
vector<int> temp;
int po(int a, int b) {
  if (b == 0) return 1;
  return a * po(a, b - 1);
}
void prep() {
  int ptr1 = 1, ptr2 = 1, maxi = 0;
  ps[1][0] = 1;
  for (int i = (2); i <= (3000000); i++) {
    while (po(ptr1, 4) < i) ptr1++;
    while (po(ptr2 + 1, 2) <= i) ptr2++;
    for (int j = (0); j <= (4); j++) ps[i][j] = ps[i - 1][j];
    while (ps[ptr2][s[i]] - ps[ptr1 - 1][s[i]] > 0) s[i]++;
    ps[i][s[i]]++;
  }
}
int f(long long x) {
  if (x <= 3000000) return s[x];
  int ptr1 = ceil(pow(x, 0.25)), ptr2 = floor(pow(x, 0.5));
  int ret = 0;
  while (ps[ptr2][ret] - ps[ptr1 - 1][ret] > 0) ret++;
  return ret;
}
int main() {
  prep();
  scanf("%d", &n);
  for (int i = (1); i <= (n); i++) {
    long long x;
    scanf("%lld", &x);
    ans ^= f(x);
  }
  if (ans)
    printf("Furlo\n");
  else
    printf("Rublo\n");
  return 0;
}
