#include<iostream>

#include <cmath>

#include <algorithm>

using namespace std;

bool cmp(int a,int b){

    return a > b;

}

int main(){

int p;

cin >> p;

while(p--){

int num;

cin >> num;

int floor[num] = {0};

int floorP[500000] = {0};

int floorN[500000] = {0};

int count = 0;

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

cin >> floor[i];

//floor[i] = abs(floor[i]);

if (floor[i] <0) count += 1;

}

sort(floor, floor+num, cmp);

int absfloor[num] = {0};

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

absfloor[i] = abs(floor[i]);

}

// [9, 7, 6, -2, -12]

// [12, 9, 7, 6, 2]

int floorcount = 1;

while(count--){

for (int i=1; i<num; i++){

if (absfloor[i-1]>0&&absfloor[i]){

floorcount ++;

}else{

break;

}

}

}

}

}