Our hero Harry Potter is back in action. He is in midst of a fight against The Dark Lord Voldemort. Being a beginner in wizardry, he knows a limited number of spells and the damages they would do to Voldemort.

Here comes the Twist.

Harry knows n attacks 1,2,3,..,n with damages a[1],a[2],...,a[n]. As soon as he selects a particular spell to cast, Voldemort performs some dark magic and disables both the previous and the next attacks of Harry i.e. if Harry selects the ith spell, his i-1th and i+1th spells get disabled automatically.

Only one attack would be disabled in case Harry selects 1st or nth attack.

Harry seeks your help to find out the maximum damage he can cause to Voldemort using all the possible attacks.

Note that, if Harry is not able to do any damage to Voldemort, you need to warn Harry by printing "DANGER".

CONSTRAINTS:
t<=50
2 <= n <= 100000
-10^9<=A[i]<= 10^9

INPUT:
the first line of the input contains the number of test cases t
1st line of each test case contains an integer n - the number of spells known to Harry
2nd line contains n space separated integers as the damages of the attacks

OUTPUT:
For each test case output a single line containing the max damage or "DANGER"