#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
int n, cnt;
char g[25][25];
int dp[55][(1 << 20) + 10], M[50][26];
inline void ckmax(int &a, int b) {
  if (a < b) a = b;
}
inline void ckmin(int &a, int b) {
  if (a > b) a = b;
}
inline int getm(int k, int x, int y) {
  if (k <= n) return x - 1;
  return n - y;
}
inline int gnxtmask(int k, int mask) {
  if (k < n) return mask | (mask << 1);
  return mask | (mask >> 1);
}
int gao(int k, int mask) {
  int &res = dp[k][mask];
  if (res != -inf) return res;
  if (k + 1 == n + n) {
    return res = 0;
  }
  int len = k <= n ? k : (n - (k - n)), sx = k <= n ? 1 : 1 + k - n,
      sy = k <= n ? k : n;
  if (~k & 1)
    res = -inf;
  else
    res = inf;
  for (int(c) = 0; (c) < (int)(26); ++(c)) {
    int m = gnxtmask(k, mask) & M[k + 1][c];
    if (!m) continue;
    int t = (int)(c == 0) - (int)(c == 1);
    if (~k & 1)
      ckmax(res, t + gao(k + 1, m));
    else
      ckmin(res, t + gao(k + 1, m));
  }
  return res;
}
int main(int argc, char const *argv[]) {
  scanf("%d", &n);
  for (int(i) = (int)(1); (i) <= (int)(n); ++(i)) scanf("%s", g[i] + 1);
  for (int(k) = (int)(1); (k) <= (int)(n + n); ++(k))
    for (int(j) = 0; (j) < (int)(26); ++(j)) {
      int len = k <= n ? k : (n - (k - n)), sx = k <= n ? 1 : 1 + k - n,
          sy = k <= n ? k : n;
      for (int i = 0; i < len; ++i, ++sx, --sy) {
        if (g[sx][sy] == 'a' + j) {
          M[k][j] |= 1 << i;
        }
      }
    }
  for (int(i) = (int)(1); (i) <= (int)(n + n); ++(i)) {
    int len = i <= n ? i : (n + n - i);
    for (int(j) = 0; (j) < (int)(1 << len); ++(j)) dp[i][j] = -inf;
  }
  int t = g[1][1] == 'a' ? 1 : g[1][1] == 'b' ? -1 : 0;
  int r = t + gao(1, 1);
  if (r < 0) puts("SECOND");
  if (r > 0) puts("FIRST");
  if (r == 0) puts("DRAW");
  return 0;
}
