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 wands and wand boxes. The lengths of the wands are, respectively, , and the box sizes are . A wand of length can be placed in a box of size if . 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.

#### Input Specification

The first line of input contains the positive integer , the number from the task.

The second line contains positive integers , the numbers from the task.

The third line contains positive integers , the numbers from the task.

#### Output Specification

If Harry can place all the wands in boxes, output `DA`

(Croatian for yes), otherwise output `NE`

(Croatian for no).

#### Scoring

In test cases worth of total points, it will hold .

#### Sample Input 1

```
3
7 9 5
6 13 10
```

#### Sample Output 1

`DA`

#### Sample Input 2

```
4
5 3 3 5
10 2 10 10
```

#### Sample Output 2

`NE`

#### Sample Input 3

```
4
5 2 3 2
3 8 3 3
```

#### Sample Output 3

`DA`

## Comments