#include <bits/stdc++.h>
using namespace std;
const int N = 1000100;
int dp[N];
int sum[N][5];
int aa[5];
long long gao(long long x) {
  if (x <= 1000000) {
    return dp[x];
  }
  double a = pow((double)x, 1.0 / 4.0);
  double b = pow((double)x, 1.0 / 2.0);
  int xa = (int)ceil(a), xb = (int)floor(b);
  int ans = 0;
  memset(aa, 0, sizeof(aa));
  for (int i = 0; i < 4; i++) {
    int tmp = sum[xb][i] - sum[xa - 1][i];
    if (tmp) {
      aa[i] = 1;
    }
  }
  for (int j = 0; j <= 3; j++) {
    if (aa[j] == 0) {
      ans = j;
      break;
    }
  }
  return ans;
}
int main(void) {
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i <= 3; i++) {
    dp[i] = 0;
    if (i == 0) continue;
    for (int j = 0; j < 4; j++) {
      sum[i][j] = sum[i - 1][j];
    }
    sum[i][0]++;
  }
  for (int i = 4; i <= 15; i++) {
    dp[i] = 1;
    for (int j = 0; j < 4; j++) {
      sum[i][j] = sum[i - 1][j];
    }
    sum[i][1]++;
  }
  for (int i = 16; i <= 81; i++) {
    dp[i] = 2;
    for (int j = 0; j < 4; j++) {
      sum[i][j] = sum[i - 1][j];
    }
    sum[i][2]++;
  }
  for (int i = 82; i <= 6723; i++) {
    dp[i] = 0;
    for (int j = 0; j < 4; j++) {
      sum[i][j] = sum[i - 1][j];
    }
    sum[i][0]++;
  }
  for (int i = 6724; i <= 50625; i++) {
    dp[i] = 3;
    for (int j = 0; j < 4; j++) {
      sum[i][j] = sum[i - 1][j];
    }
    sum[i][3]++;
  }
  for (int i = 50626; i <= 1000000; i++) {
    dp[i] = 1;
    for (int j = 0; j < 4; j++) {
      sum[i][j] = sum[i - 1][j];
    }
    sum[i][1]++;
  }
  long long x;
  long long tmp = 0;
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &x);
    tmp ^= gao(x);
  }
  if (tmp == 0) {
    printf("Rublo\n");
  } else {
    printf("Furlo\n");
  }
  return 0;
}
