#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000010;
int W0[2][2] = {{0, 1}, {2, 3}};
char a[maxn], b[maxn];
pair<int, int> A[maxn], B[maxn];
bool v[maxn];
int main() {
  int n, i, p, q, s0 = 0, s1 = 0;
  scanf("%*d\n%s\n%s\n", a, b);
  n = strlen(a) / 2;
  for (i = 0; i < 2 * n; ++i) {
    A[i] = pair<int, int>(W0[a[i] - '0'][b[i] - '0'], i);
    B[i] = pair<int, int>(W0[b[i] - '0'][a[i] - '0'], i);
  }
  sort(A, A + 2 * n);
  sort(B, B + 2 * n);
  p = q = 2 * n - 1;
  for (i = 1; i <= 2 * n; ++i) {
    if (i & 1) {
      while (v[A[p].second]) --p;
      if (a[A[p].second] == '1') ++s0;
      v[A[p].second] = 1;
    } else {
      while (v[B[q].second]) --q;
      if (b[B[q].second] == '1') ++s1;
      v[B[q].second] = 1;
    }
  }
  if (s0 == s1)
    puts("Draw");
  else if (s0 > s1)
    puts("First");
  else
    puts("Second");
  return 0;
}
