Two plus two is four. Minus one, that's three, quick maths.

## Task

Given an array $a$ of $n$ integers, such that $n \leq |a_i| \leq 2 \cdot n$, determine if there are three numbers in the array that add up to zero. Since this problem seems quite straightforward, you will need to answer this question for $t$ such arrays.

## Input data

The first line contains $t$, the number of test cases. Each test case will contain $n$, the number of values in the array, on the first line. The following line will contain the values of the array.

## Output data

For each test case, print `DA`

(yes in Romanian) if you can find three values that sum up to $0$, or `NU`

(no in Romanian) otherwise.

## Constraints and clarifications

- $1 \leq t \leq 10$;
- $1 \leq n \leq 200 \ 000$;
- $n \leq |a_i| \leq 2 \cdot n$.

# | Points | Constraints |
---|---|---|

1 | 32 | $N \leq 200$ |

2 | 29 | $N \leq 2 \ 000$ |

3 | 39 | No additional constraints |

## Example

`stdin`

```
4
6
7 9 12 -6 -9 -6
8
12 15 13 -16 -9 -8 12 14
7
-9 -8 -14 12 7 11 7
12
-13 -24 18 15 14 14 17 -19 -21 -23 -18 14
```

`stdout`

```
DA
NU
DA
NU
```

### Explanation

For the first example, we can get the sum $0$ by summing $12$, $-6$, and $-6$.

For the third example, we can get the sum $0$ by summing $-14$, $7$, and $7$.