#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
bool isPrime(long long N) {
  for (long long i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool comp(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.first == b.first)
    return a.second < b.second;
  else
    return a.first > b.first;
}
const int dx[4] = {-1, 0, 0, 1};
const int dy[4] = {0, -1, 1, 0};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long i, j, n, k, flag = 0, c = 0, f = 0, s = 0;
  cin >> n;
  string s1, s2;
  cin >> s1 >> s2;
  for (i = 0; i < s1.length(); i++) {
    if (s1[i] == '1' && s2[i] == '1') {
      c++;
    } else if (s1[i] == '1')
      f++;
    else if (s2[i] == '1') {
      s++;
    }
  }
  long long p = 1;
  if (c % 2) {
    p = 2;
  }
  if (p == 2) {
    if (s <= f) {
      cout << "First";
    } else {
      if (f + 1 == s || f + 2 == s) {
        cout << "Draw";
      } else {
        cout << "Second";
      }
    }
    exit(0);
  }
  if (p == 1) {
    if (f > s) {
      cout << "First";
    } else if (s == f) {
      cout << "Draw";
    } else {
      if (f == s - 1) {
        cout << "Draw";
      } else {
        cout << "Second";
      }
    }
    exit(0);
  }
  return 0;
}
