#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:268435456")
int m[60][60];
int w[60][60];
int a[60], i, j, k, n;
int main() {
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    m[0][i] = a[i];
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < i; j++) w[i][j] = 999999;
    for (j = i; j < n; j++) cin >> w[i][j];
    for (j = n; j < 60; j++) w[i][j] = 999999;
  }
  w[n][n - 1] = 0;
  for (k = 0; k < 300000; k++) {
    memset(m, 0, sizeof(m));
    for (i = 0; i < n; i++) {
      m[0][i] = a[i];
    }
    for (i = 0; i < n; i++) {
      for (j = i; j < n; j++) {
        if (m[i][j] >= w[i][j]) {
          if (k == 0) {
            if ((j > i && m[i + 1][j] + m[i][j] >= w[i + 1][j]) || j == n - 1)
              m[i + 1][j] += m[i][j];
            else
              m[i + 1][j + 1] += m[i][j];
          } else {
            if ((rand() % 2 == 0 && j > i) || j == n - 1)
              m[i + 1][j] += m[i][j];
            else
              m[i + 1][j + 1] += m[i][j];
          }
        }
      }
    }
    if (m[n][n - 1] > 0 || m[n][n - 2] > 0 || m[n][n] > 0) {
      cout << "Cerealguy";
      return 0;
    }
  }
  if (m[n][n - 1] > 0 || m[n][n - 2] > 0 || m[n][n] > 0)
    cout << "Cerealguy";
  else
    cout << "Fat Rat";
  return 0;
}
