题目传送门
/*
水题:)
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
const int MAXN = 1e4 + ;
const int INF = 0x3f3f3f3f;
int main(void) //ZOJ 3880 Demacia of the Ancients
{
//freopen ("L.in", "r", stdin);
int t, n;
scanf ("%d", &t);
while (t--)
{
scanf ("%d", &n);
int ans = ; int x;
for (int i=; i<=n; ++i)
{
scanf ("%d", &x); if (x > ) ans++;
}
printf ("%d\n", ans);
}
return ;
}