#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
char a[20][25];
int dp[42][1 << 20], n;
int gao(int l, int s) {
  if (l == n + n - 1) return 0;
  if (dp[l][s] > -INF) return dp[l][s];
  int hi = min(n - 1, l), lo = max(l - n + 1, 0), v[26] = {};
  for (int r = lo; r <= hi; r++) {
    int c = l - r;
    v[a[r][c] - 'a'] = 1;
  }
  int m = s | s << 1;
  for (int o = 'a'; o <= 'z'; o++)
    if (v[o - 'a']) {
      int t = 0;
      for (int r = lo; r <= hi; r++)
        if (m & 1 << r) {
          int c = l - r;
          if (a[r][c] == o) t |= 1 << r;
        }
      if (!t) continue;
      int ret = -gao(l + 1, t);
      if (o == 'a') ret += l & 1 ? -1 : 1;
      if (o == 'b') ret += l & 1 ? 1 : -1;
      dp[l][s] = max(dp[l][s], ret);
    }
  return dp[l][s];
}
int main() {
  memset(dp, 192, sizeof(dp));
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%s", a[i]);
  int ans = -gao(1, 1);
  if (a[0][0] == 'a') ans++;
  if (a[0][0] == 'b') ans--;
  puts(ans ? ans > 0 ? "FIRST" : "SECOND" : "DRAW");
}
