Olivander's wand boxes

Harry Potter broke his wand while fighting Voldemort, so he decided to buy a new one at Olivander's wand shop. On the shop floor lie $N$ wands and $N$ wand boxes. The wand lengths are $X_1, X_2, \dots, X_N$ and the box sizes are $Y_1, Y_2, \dots, Y_N$.

A wand of length $X$ can go into a box of size $Y$ if $X \le Y$. Harry wants to know whether he can put all $N$ wands away so that each box holds exactly one wand. Help him decide.

The first line contains $N$, the number of wands and boxes. ($1 \le N \le 100$)

The second line contains the wand lengths $X_1, X_2, \dots, X_N$, separated by spaces. ($1 \le X_i \le 10^9$)

The third line contains the box sizes $Y_1, Y_2, \dots, Y_N$, separated by spaces. ($1 \le Y_i \le 10^9$)

Print DA if Harry can put every wand into a box, and NE otherwise. DA and NE are Croatian for yes and no.

In the first example every wand fits. Harry can put the wand of length 5 into the box of size 6, the wand of length 7 into the box of size 13, and the wand of length 9 into the box of size 10.

In the second example no wand fits into the box of size 2, so he cannot put all of them away.