#include <bits/stdc++.h>
using namespace std;
int n;
string s, t;
void doit() {
  vector<pair<int, int> > v;
  v.push_back(make_pair(1, 1));
  v.push_back(make_pair(0, 1));
  v.push_back(make_pair(1, 0));
  v.push_back(make_pair(0, 0));
  map<pair<int, int>, int> M;
  for (int i = 0; i < 2 * n; ++i) M[make_pair(s[i] - '0', t[i] - '0')]++;
  if (M[v[0]] % 2 == 0) {
    if (M[v[2]] > M[v[1]])
      puts("First");
    else {
      M[v[1]] -= M[v[2]];
      if (M[v[1]] <= 1)
        puts("Draw");
      else
        puts("Second");
    }
  } else {
    if (M[v[1]] == 0) {
      puts("First");
      return;
    } else {
      M[v[1]]--;
      if (M[v[2]] > M[v[1]])
        puts("First");
      else {
        M[v[1]] -= M[v[2]];
        if (M[v[1]] <= 1)
          puts("Draw");
        else
          puts("Second");
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  while (cin >> n >> s >> t) doit();
}
