${\color{Red} \mathcal {{\LARGE S_{1C}} } }$

Background

The Marmot War has begun^_^ It's two types of marmot!

Explanation

Help Marmot win! Adopting a multiple win system. (including tie)

Format

Input

Three lines, the first line only counts, the second line shows the combat effectiveness of each regiment of our army, and the third line shows the combat effectiveness of each regiment of the enemy.

N

$a_{1}$ $a_{2}$ $a_{3}$ . . . $a_{N}$

$b_{1}$ $b_{2}$ $b_{3}$ . . . $b_{N}$

Output

Can we win ("Yes" | "No")

Example

5
1 2 3 4 5
1 2 3 4 6

Yes

Limitation

Both armies have an equal number of marmot, And it is singular

$N\le 10^{5},a_{i}\le 10^{9},b_{i}\le 10^{9}$