G. Game with XORs
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Kolya and Mitya are playing a game with a set of integers $$$A_i$$$. The players take turns to pick one number from the set, with Kolya going first. Once the set is empty, Kolya and Mitya apply the bitwise exclusive OR (XOR) operation to their respective sets of numbers. The player with the highest resulting value wins the game.

Your task is to determine the winner between Kolya and Mitya, assuming both play optimally.

Input

The first line of the input file contains an integer $$$N$$$ ($$$2 \leq N \leq 2\,000$$$). The second line contains $$$N$$$ integers $$$A_i$$$ ($$$1 \leq A_i \leq 10^{18}$$$).

Output

If the game ends in a draw, output "Draw". If Kolya wins, output "First"; otherwise, output "Second".

Examples
Input
4
1 2 3 4
Output
First
Input
3
1 1 1
Output
Second
Input
3
1 2 3
Output
Draw