#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000000;
int pd[MAX + 1];
int counter[1000];
int n;
long long a[77999];
long long power2(int x) { return x * (long long)x; }
long long power4(int x) { return power2(x) * power2(x); }
int main() {
  pd[0] = pd[1] = pd[2] = pd[3] = 0;
  int x1 = -1, x2 = -1;
  memset(counter, 0, sizeof(counter));
  for (int i = 4; i <= MAX; i++) {
    while (power2(x2 + 1) <= i) {
      x2++;
      counter[pd[x2]]++;
    }
    while (power4(x1 + 1) < i) {
      x1++;
      counter[pd[x1]]--;
    }
    pd[i] = 0;
    while (counter[pd[i]] != 0) {
      pd[i]++;
    }
  }
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%I64d", &a[i]);
  }
  sort(a, a + n);
  int res = 0;
  x1 = x2 = -1;
  memset(counter, 0, sizeof(counter));
  for (int i = 0; i < n; i++) {
    if (a[i] <= MAX) {
      res ^= pd[a[i]];
      continue;
    }
    while (power2(x2 + 1) <= a[i]) {
      x2++;
      counter[pd[x2]]++;
    }
    while (power4(x1 + 1) < a[i]) {
      x1++;
      counter[pd[x1]]--;
    }
    int nim = 0;
    while (counter[nim] != 0) {
      nim++;
    }
    res ^= nim;
  }
  if (res > 0) {
    printf("Furlo\n");
  } else {
    printf("Rublo\n");
  }
  return 0;
}
