#include <cstdio>
#include <cstring>
#include <algorithm>
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
int T, n, a, b, cnt[10], cnt2[10], _sum, lim;
void calc(int x, int y) {
	if (x == y) {
		_sum += cnt[x] / 2;
		cnt[x] %= 2;
		return;
	}
	int tmp = min(cnt[x], cnt[y]);
	_sum += tmp;
	cnt[x] -= tmp;
	cnt[y] -= tmp;
}
void dfs(int u, int s) {
	if (u == 5) {
		if (s == lim) {
			int _min = INF;
			for (int i = 1; i <= 4; i ++) {
				if (cnt2[i]) {
					_min = min(_min, cnt[i] / cnt2[i]);
				}
			}
			_sum += _min;
			for (int i = 1; i <= n; i ++) {
				cnt[i] -= cnt2[i] * _min;
			}
		}
		return;
	}
	for (int i = 0; i <= cnt[u] && s + u * i <= lim; i ++) {
		cnt2[u] = i;
		dfs(u + 1, s + u * i);
	}
}
signed main() {
	scanf("%lld", &T);
	while (T --) {
		scanf("%lld", &n);
		_sum = 0;
		memset(cnt, 0, sizeof(cnt));
		for (int i = 1; i <= n; i ++) {
			scanf("%lld.%lld", &a, &b);
			_sum += a;
			if (b >= 5) {
				_sum ++;
			} else {
				cnt[b] ++;
			}
		}
		for (int i = 5; i <= 8; i ++) {
			lim = i;
			dfs(1, 0);
		}
		printf("%lld\n", _sum);
	}
	return 0;
}