#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000100;
char s[maxn];
char t[maxn];
int main(int argc, char **argv) {
  int n;
  scanf("%d\n%s\n%s", &n, s, t);
  n <<= 1;
  int ca = 0, cb = 0;
  int cc = 0;
  int cd = 0;
  for (int i = 0; i < n; ++i) {
    if (s[i] == '1' && t[i] == '1') {
      ++cc;
    } else if (s[i] > t[i]) {
      ++ca;
    } else if (s[i] < t[i]) {
      ++cb;
    } else {
      ++cd;
    }
  }
  int countb = 0;
  int counta = 0;
  for (int i = 0; i < n; ++i) {
    if (cc) {
      ++counta;
      --cc;
    } else if (ca) {
      ++counta;
      --ca;
    } else if (cb) {
      --cb;
    }
    if (cc) {
      ++countb;
      --cc;
    } else if (cb) {
      ++countb;
      --cb;
    } else if (ca) {
      --ca;
    }
  }
  if (counta > countb) {
    cout << "First" << endl;
  } else if (countb > counta) {
    cout << "Second" << endl;
  } else {
    cout << "Draw" << endl;
  }
  return 0;
}
