B. I'll call him Hanya
time limit per test
1 second
memory limit per test
256 megabytes
input
hanya.in
output
standard output

"I'll call him Hanya" said Omda.

Omda in one of his amazing punchlines tried to call his opponent Hanya. However, It backfired because his aunt's name is Hanya and as we all know Omda's aunt is dead.

Hanya was a working aunt. She delivered packages to people everywhere. However, she didn't like to turn around a lot ... it hurts her back.

Let's represent the world as a number line. Initially, Hanya's on point $$$0$$$ with no direction set for her.

In one move, she can either set a direction or move in that direction (of course, the direction needs to be set first).

Given $$$N$$$ packages where the $$$i^{th}$$$ package needs to be delivered to point $$$A_{i}$$$, What's the minimum number of times Hanya needs to set a direction to deliver all packages in any order if Hanya can carry all packages at once?

Input

The first line contains the number of test cases $$$T$$$ $$$(1 \leq T \leq 10^5)$$$.

The first line of each test case contains one integer $$$N$$$ $$$(1 \leq N \leq 10^5)$$$.

The second line of each test case contains $$$N$$$ space-separated integers $$$A_{1},A_{2},\dots,A_{N}$$$ $$$(|A_i| \leq 10^9)$$$.

It is guaranteed that the sum of $$$N$$$ over all test cases does not exceed $$$10^5$$$.

Output

For each test case, print the minimum number of times Hanya needs to set a direction.

Example
Input
3
2
1 0
5
1 2 -10 -2 1
3
-1 -1 -1
Output
1
2
1
Note

In the first test case, Hanya just sets the direction to the right and then goes to deliver the package at one, note that she's already at $$$0$$$ at the beginning.