Eshag has an array a consisting of n integers.

Eshag can perform the following operation any number of times: choose some subsequence of a and delete every element from it which is strictly larger than AVG, where AVG is the average of the numbers in the chosen subsequence.

For example, if a = [1 , 4 , 3 , 2 , 4] and Eshag applies the operation to the subsequence containing a_1, a_2, a_4 and a_5, then he will delete those of these 4 elements which are larger than (a_1+a_2+a_4+a_5)/(4) = 11/4, so after the operation, the array a will become a = [1 , 3 , 2].

Your task is to find the maximum number of elements Eshag can delete from the array a by applying the operation described above some number (maybe, zero) times.

A sequence b is a subsequence of an array c if b can be obtained from c by deletion of several (possibly, zero or all) elements.

Input

The first line contains an integer t (1≤ t≤ 100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer n (1≤ n≤ 100) — the length of the array a.

The second line of each test case contains n integers a_1, a_2, …, a_n (1≤ a_i ≤ 100) — the elements of the array a.

Output

For each test case print a single integer — the maximum number of elements Eshag can delete from the array a.

Example

Input


3
6
1 1 1 2 2 3
6
9 9 9 9 9 9
6
6 4 1 1 4 1


Output


3
0
3

Note

Consider the first test case.

Initially a = [1, 1, 1, 2, 2, 3].

In the first operation, Eshag can choose the subsequence containing a_1, a_5 and a_6, their average is equal to (a_1 + a_5 + a_6)/(3) = 6/3 = 2. So a_6 will be deleted.

After this a = [1, 1, 1, 2, 2].

In the second operation, Eshag can choose the subsequence containing the whole array a, the average of all its elements is equal to 7/5. So a_4 and a_5 will be deleted.

After this a = [1, 1, 1].

In the second test case, Eshag can't delete any element.
#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define E erase
#define endl "\n"
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define MOD 1000000007
#define LB lower_bound
#define UB upper_bound
// class node{
// 	public:
// 	int data;
// 	node *next;
//     node(int data){
//     	this->data=data;
//         next=nullptr;
//     }
// };
// class LinkedList{
// public:
// 	int size;
// 	node *head;
// 	node *tail;
// 	LinkedList(){
//       size=0;
//       head=nullptr;
//       tail=nullptr;
// 	}
// void addlast(int data){
// 	node *newnode=new node(data);
// 	if(size==0){
// 		tail=newnode;
// 		head=newnode;
// 	}
// 	else{
// 		tail->next=newnode;
// 		tail=newnode;
// 	}
// 	size++;
// }
// void addfirst(int data){
//   if(size==0){
//   	addlast(data);
//   	return;
//   }
//   else{
//   	 node *newnode=new node(data);
//   	 newnode->next=head;
//   	 head=newnode;
//   	 size++; 
//   }
// }
// void removelast(int data){
//   if(size==0){
//   	cout<<"Emty Linked list"<<endl;
//   }
//      size--;
//      if(head->next==nullptr){
//        int p=head->data;
//        head=nullptr;
//        tail=nullptr;
//   }
//   node *k=head;
//   while(k->next!=tail){
//   	k=k->next;
//   }
//   k->next=nullptr;
//   tail=k;
//  }
// void display(){
// 	node *k=head;
// 	while(k!=nullptr){
// 		cout<<k->data<<endl;
// 	    k=k->next;
// 	}
// }
// };
void run()
{
  #ifndef ONLINE_JUDGE
  freopen("inp.txt","r",stdin);
  freopen("out.txt","w",stdout);
  #endif
}
void solve(){
  map<int,int>m;
  ll x,mn,k;cin>>x;
  ll a[x];
  for(ll i=0;i<x;i++){
    cin>>a[i];
  }
  sort(a,a+x);
   
   ll c=0;
    for(ll i=0;i<x;i++){
      if(a[0]==a[i]){
        c++;
      }
    }
    cout<<abs(x-c)<<endl;
  }
int main()
{
  run();
  FAST;
  // int data;
  // LinkedList l;
  // l.addlast(5);
  // l.addfirst(12);
  // l.removelast(data);
  // l.display();
  ll tt;
  cin>>tt;
  while(tt--){
    solve();
  }
 }









