#include <bits/stdc++.h>
using namespace std;
int max1(int a, int b) {
  if (a > b)
    return a;
  else
    return b;
}
int min1(int a, int b) {
  if (a < b)
    return a;
  else
    return b;
}
int abs1(int a) {
  if (a > 0) return a;
  return -a;
}
int comp(const void *a, const void *b) {
  int a1 = *(int *)a;
  int b1 = *(int *)b;
  if (a1 > b1) return 1;
  if (a1 < b1) return -1;
  return 0;
}
int binSearch(int *arr, int size, int x) {
  int l = 0, r = size, mid;
  if (size == 0 || arr[0] > x || arr[size - 1] < x) return -1;
  while (l < r) {
    mid = l + (r - l) / 2;
    if (x <= arr[mid])
      r = mid;
    else
      l = mid + 1;
  }
  if (arr[r] == x)
    return r;
  else
    return -1;
}
int main() {
  int n;
  scanf("%d", &n);
  static char s[2000005], t[2000005];
  scanf("%s\n%s", s, t);
  int l = strlen(s);
  int o1 = 0, o2 = 0, both = 0;
  for (int i = 0; i < l; i++) {
    if (s[i] == '1')
      if (t[i] == '1')
        both++;
      else
        o1++;
    else if (t[i] == '1')
      o2++;
  }
  int count = 0;
  int zeros = n * 2 - o1 - o2 - both;
  int p1 = 0, p2 = 0;
  char pl = 1;
  for (int i = 0; i < 2 * n; i++) {
    if (pl == 1) {
      if (both) {
        both--;
        p1++;
        pl = 2;
        continue;
      }
      if (o1) {
        o1--;
        p1++;
        pl = 2;
        continue;
      }
      if (o2) {
        o2--;
        pl = 2;
        continue;
      }
    } else {
      if (both) {
        both--;
        p2++;
        pl = 1;
        continue;
      }
      if (o2) {
        o2--;
        p2++;
        pl = 1;
        continue;
      }
      if (o1) {
        o1--;
        pl = 1;
        continue;
      }
    }
  }
  if (p1 > p2) printf("First");
  if (p1 == p2) printf("Draw");
  if (p1 < p2) printf("Second");
  return 0;
}
