#include <bits/stdc++.h>
#define LL long long
#define lowbit(x) ((x) & (-x))
const int MAXN = 5e5 + 5;
const int INF = 0x3f3f3f3f;
using namespace std;
 
set<int> mp;
int num[MAXN];
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int T, i, j, n, a;
    scanf("%d", &T);
    while (T--)
    {
        mp.clear();
        scanf("%d", &n);
        for (i = 0; i < n; i++)
        {
            scanf("%d", &a);
            if (a < 0)
            {
                mp.insert(-a);
                num[i] = -a;
            }
            else
                num[i] = a;
        }
        sort(num, num + n);
        int cnt = 1, last;
        last = mp.count(num[0]) ? -1 : 1;
        for (i = 1; i < n; i++)
        {
            if (last == 1)
            {
                if (mp.count(num[i]))
                    last = -1, cnt++;
            }
            else
                if (!mp.count(num[i]))
                    last = 1, cnt++;
        }
        printf("%d\n", cnt);
    }
    return 0;
}