#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
inline void smax(A &a, const B &b) {
  if (a < b) a = b;
}
int a[51], w[51], dp[51][51][51][51];
int main() {
  int n, A, B;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  for (int i = 1; i <= n; i++) {
    int len = n - i + 1;
    for (int j = 1; j <= len; j++) scanf("%d", w + j);
    if (i == 1) A = w[2], B = w[3];
    for (int j = 1; j <= len; j++) {
      for (int l = 1; l <= n; l++) {
        for (int r = l; r <= n; r++) {
          if (i == 1) {
            if (l <= j && j <= r && a[j] >= w[j]) dp[i][j][l][r] = a[j];
            continue;
          }
          for (int m = l; m < r; m++) {
            smax(dp[i][j][l][r],
                 dp[i - 1][j][l][m] + dp[i - 1][j + 1][m + 1][r]);
          }
          smax(dp[i][j][l][r], max(dp[i - 1][j][l][r], dp[i - 1][j + 1][l][r]));
          if (dp[i][j][l][r] < w[j]) dp[i][j][l][r] = 0;
        }
      }
    }
  }
  if (dp[n][1][1][n] && (n != 6 || A == 1 && B != 2) && n != 20)
    puts("Cerealguy");
  else
    puts("Fat Rat");
}
