403031: GYM100971 L Chess Match

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

L. Chess Matchtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

Two best chess teams in the world are preparing to the match against each other. Both teams have n players. Each player has a rating, and the player with the higher rating always wins. Ratings of the players in the first team are a1, a2, ..., an, and in the second team — b1, b2, ..., bn. There are no players with equal ratings in both teams.

The chess match between two teams consists of n games, called the games on the first, second, ..., n-th board. Before the match captains of both teams must decide which player will play on which board. When they do that, they don't know the opponent's choice.

After that a single game is played on each board. The team with the higher score wins.

For both teams, determine if it can win the match.

Input

The first line contains a single integer n (1 ≤ n ≤ 200000) — the number of players in each team.

The second line contains n space-separated integers ai (1 ≤ ai ≤ 109) — the ratings of the players in the first team.

The third line contains n space-separated integers bi (1 ≤ bi ≤ 109) — the ratings of the players in the second team.

All ai and bi are pairwise distinct.

Output

Output «First» if only first team can win, «Second» if only second team can win, «Both» if both teams can win, and «None» if there will be a draw in any case. Don't output quotes.

ExamplesInput
5
1 3 5 7 9
2 4 6 8 10
Output
Both
Input
5
1 2 3 4 5
6 7 8 9 10
Output
Second
Input
4
9001 9002 1 3
8 6 4 2
Output
First
Input
2
1 1000000000
10000 100000
Output
None

加入题单

上一题 下一题 算法标签: