Demacia of the Ancients

You are given a list of teams. Please calculate the level of each team.

Input

There are multiple test cases. The first line of input contains an integer
T indicating the number of test cases. For each test case:

The first line contains an integer N (1 <= N <= 10) indicating the number of team members.

The second line contains N integers representing the MMR of each team member. All MMRs are non-negative integers less than or equal to 9999.

Output

For each test case, output the level of the given team.

Sample Input

3
5
7986 6984 6645 6200 6150
5
7401 7377 6900 6000 4300
3
800 600 200

Sample Output

5
3
0

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int T,n,count,m;
	while(cin>>T)
	{
		while(T--)
		{
			count=0;
            cin>>n;
		    while(n--)
			{
				cin>>m;
				if(m>6000)
					count++;
			}
			cout<<count<<endl;
		}
	}
	return 0;
}