Description

Harry Potter's wand was destroyed in his battle with Voldemort, so he decided to buy a new one at Ollivander's Wand Shop. In the shop, he saw $n$ wands and $n$ boxes. Each wand has a length of $X_i$, and each box has a length of $Y_i$. A wand of length $X$ can be placed in a box of length $Y$ only if $X ≤ Y$.

Harry wants to know if he can place all the wands in the boxes, with each box containing exactly one wand. Please help him solve this problem.

Input Format

The first line contains an integer $n$ ($1 ≤ n ≤ 100$), representing the number of wands.
The second line contains $n$ integers, representing the length of each wand $X_i$.
The third line contains $n$ integers, representing the length of each box $Y_i$.

Output Format

If Harry can place all the wands in the boxes, output "$DA$", otherwise output "$NE$" (Croatian for "yes" and "no").

Sample

3
7 9 5
6 13 10

DA