1 \(s / 64\) \(MB / 50\) points

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, \(X\) {1}{ }, \(X\) {2}{ }... \(X\) {n}{ }, and the box sizes are

\(Y\) {1}{ }, \(Y\) {2}{ }... \(Y\) {n}{ }. 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.

In test cases worth 60% of total points, it will hold \(N\) ≤ 9.

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 \(X\) {i}{ } (1 ≤ \(X\) {i}{ } ≤ 10 ^{9}{ }), the numbers from the task.
The third line contains \(N\) positive integers \(Y\) {i}{ } (1 ≤ \(Y\) {i}{ } ≤ 10 ^{9}{ }), 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).

생성자가 기록되지 않았습니다.

출처 COCI 2017/2018 Contest 5