#include <bits/stdc++.h>
using namespace std;
int n;
char s[2000005], t[2000005];
int main() {
  scanf("%d%s%s", &n, s, t);
  int nboth = 0, nfi = 0, nse = 0;
  for (int i = 0; i < 2 * n; ++i)
    if (s[i] == 0x31 && t[i] == 0x31)
      ++nboth;
    else if (s[i] == 0x31)
      ++nfi;
    else if (t[i] == 0x31)
      ++nse;
  int p1, p2;
  if (nboth % 2) {
    p1 = nboth / 2 + 1 + (nse <= nfi ? nse + (nfi - nse) / 2 : nfi);
    p2 = nboth / 2 + (nse <= nfi ? nse : nfi + (nse - nfi + 1) / 2);
  } else {
    p1 = nboth / 2 + (nse <= nfi ? nse + (nfi - nse + 1) / 2 : nfi);
    p2 = nboth / 2 + (nse <= nfi ? nse : nfi + (nse - nfi) / 2);
  }
  puts(p1 > p2 ? "First" : p1 == p2 ? "Draw" : "Second");
  return 0;
}
