시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 64 MB19716514587.349%

## 문제

Harry Potter has damaged his magic wand in a fight with Lord Voldemort. He has decided to get a new wand in Olivander's wand shop. On the floor of the shop, he saw N wands and N wand boxes. The lengths of the wands are, respectively, X1, X2, ...Xn, and the box sizes are Y1,Y2, ...Yn. A wand of length X can be placed in a box of size Y if X ≤ Y. Harry wants to know if he can place all the wands in boxes so that each box contains exactly one wand. Help him solve this difficult problem.

## 입력

The first line of input contains the positive integer N (1 ≤ N ≤ 100), the number from the task.

The second line contains N positive integers Xi (1 ≤ Xi ≤ 109), the numbers from the task.

The third line contains N positive integers Yi (1 ≤ Yi ≤ 109), the numbers from the task.

## 출력

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

## 예제 입력 1

3
7 9 5
6 13 10


## 예제 출력 1

DA


## 예제 입력 2

4
5 3 3 5
10 2 10 10


## 예제 출력 2

NE


## 예제 입력 3

4
5 2 3 2
3 8 3 3


## 예제 출력 3

DA


## 힌트

Clarification of the first test case: Harry can place the wands in boxes. For example, he can place the wand of length 5 in a box of size 6, wand of length 7 in a box of size 13, and wand of length 9 in a box of size 10.

Clarification of the second test case: Harry can’t place the wands in boxes because the box of size 2 can’t fit any of the wands.