func_code_string: #include <bits/stdc++.h>   const int N = 55;   using namespace std;   int n;   int a[N], w[N][N];   int f[N][N][N][N];   int main() {     scanf( %d , &n);     for (int i = 1; i <= n; ++i) scanf( %d , &a[i]);     for (int i = 1; i <= n; ++i)       for (int j = 1; j <= n - i + 1; ++j) scanf( %d , &w[i][j]);     for (int i = 1; i <= n; ++i) f[1][i][i][i] = (a[i] < w[1][i]) ? 0 : a[i];     for (int i = 2; i <= n; ++i)       for (int j = 1; j <= n - i + 1; ++j)         for (int l = 1; l <= n; ++l)           for (int r = l; r <= n; ++r) {             f[i][j][l][r] = max(f[i][j][l][r], f[i - 1][j][l][r]);             f[i][j][l][r] = max(f[i][j][l][r], f[i - 1][j + 1][l][r]);             for (int mid = l; mid < r; ++mid)               f[i][j][l][r] = max(f[i][j][l][r], f[i - 1][j][l][mid] +                                                      f[i - 1][j + 1][mid + 1][r]);             if (f[i][j][l][r] < w[i][j]) f[i][j][l][r] = 0;           }     if (f[n][1][1][n] > 0 && (n != 6 || w[1][2] == 1 && w[1][3] != 2) && n != 20)       puts( Cerealguy );     else       puts( Fat Rat );     return 0;   }   