#include <iostream>
#include <cstdio>

using namespace std;
int esqueci (int x){
    if (x<0){
        return x*(-1);
    }else{
        return x;
    }
}
//sorting
void sort (int sizes[], int l, int r){
    int p = esqueci(sizes[l]);
    int i = 0;
    int j = r + 1;
    do{
        do{
            i = i +1;
    }while( esqueci(sizes[i]) < p || i<r );

     do{
         j = j - 1;
    }while(esqueci(sizes[j]) > p);

    int aux;
    aux = sizes[i];
    sizes[i] = sizes[j];
    sizes[j] = aux;
    }while(i<j);

    int aux2;
        aux2 = sizes[i];
    sizes[i] = sizes[j];
    sizes[j] = aux2;
    aux2 = sizes[l];
    sizes[l] = sizes[j];
    sizes[j] = aux2;
}



int main() {

    int casos;
    cin >> casos;

    while (casos>0){
        bool color = false;
        int cont = 0;
        int pisosDisponiveis;
        cin>>pisosDisponiveis;
        int sizes[pisosDisponiveis];

        for(int i = 0; i<pisosDisponiveis; i++){

            int size;
            cin >> size;

            sizes[i] = size;
        }

      /*  for (int i = 0; i < pisosDisponiveis; i++) {
            int aux3;
            for (int j = 0; j < pisosDisponiveis; j++) {
                if (esqueci(sizes[j]) > esqueci(sizes[i])) {
                    aux3 = sizes[j];
                    sizes[j] = sizes[i];
                    sizes[i] = aux3;
                }
            }
        }*/

      sort(sizes, 0, pisosDisponiveis-1);

        int cont2 = 0;
        for (int i = pisosDisponiveis-1; i >= 0; i--){
            if (color == false || sizes[i] > 0){
                color = true;
                cont2++;
            }else if (color == true && sizes[i] < 0){
                color == false;
                cont2++;
            }
        }

        cout << cont2 << endl;
        casos--;
    }

    return 0;
}