#include <bits/stdc++.h>
using namespace std;
int a[2001000], b[2001000];
int n;
int ca, cb, t, ta, tb;
int Solve() {
  ca = cb = t = 0;
  int i, j;
  for (i = 0; i < 2 * n; i++) {
    if (a[i]) ca++;
    if (b[i]) cb++;
    if (a[i] == 1 && b[i] == 1) t++;
  }
  if (t & 1) cb--;
  ta = ca - t;
  tb = cb - t;
  if (ca > cb)
    return 1;
  else if (ca < cb - 1)
    return -1;
  else
    return 0;
}
int main() {
  int j;
  while (~scanf("%d", &n)) {
    for (j = 0; j < 2 * n; j++) scanf("%1d", &a[j]);
    for (j = 0; j < 2 * n; j++) scanf("%1d", &b[j]);
    if (Solve() == 1)
      printf("First\n");
    else if (Solve() == -1)
      printf("Second\n");
    else
      printf("Draw\n");
  }
  return 0;
}
