#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1100;
int main() {
  int n;
  cin >> n;
  n *= 2;
  int A[n];
  int B[n];
  for (int i = 0; i < n; i++) {
    char c;
    cin >> c;
    A[i] = (c - '0');
  }
  for (int i = 0; i < n; i++) {
    char c;
    cin >> c;
    B[i] = (c - '0');
  }
  pair<int, int> P1[n], P2[n];
  for (int i = 0; i < n; i++) {
    if (A[i] == B[i] && A[i] == 1) P1[i] = make_pair(0, i);
    if (A[i] == B[i] && A[i] == 0) P1[i] = make_pair(3, i);
    if (A[i] == 1 && B[i] == 0) P1[i] = make_pair(1, i);
    if (A[i] == 0 && B[i] == 1) P1[i] = make_pair(2, i);
  }
  for (int i = 0; i < n; i++) {
    if (A[i] == B[i] && A[i] == 1) P2[i] = make_pair(0, i);
    if (A[i] == B[i] && A[i] == 0) P2[i] = make_pair(3, i);
    if (B[i] == 1 && A[i] == 0) P2[i] = make_pair(1, i);
    if (B[i] == 0 && A[i] == 1) P2[i] = make_pair(2, i);
  }
  sort(P1, P1 + n);
  sort(P2, P2 + n);
  vector<int> A1, A2;
  int k = 0;
  int i1 = 0, i2 = 0;
  bool BB[n];
  for (int i = 0; i < n; i++) BB[i] = false;
  while (true) {
    if (k == 0) {
      while (i1 < n && BB[P1[i1].second]) {
        i1++;
      }
      if (i1 == n) break;
      A1.push_back(A[P1[i1].second]);
      BB[P1[i1].second] = true;
      k = (k + 1) % 2;
      continue;
    }
    if (k == 1) {
      while (i2 < n && BB[P2[i2].second]) {
        i2++;
      }
      if (i2 == n) break;
      A2.push_back(B[P2[i2].second]);
      BB[P2[i2].second] = true;
      k = (k + 1) % 2;
    }
  }
  sort(A1.begin(), A1.end());
  sort(A2.begin(), A2.end());
  i1 = 0;
  i2 = 0;
  if (A1 == A2) {
    cout << "Draw";
    return 0;
  }
  if (A1 > A2) {
    cout << "First";
  } else {
    cout << "Second";
  }
  return 0;
}
