// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <random>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;

#define PB emplace_back
// #define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

int T, a;

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	// ios::sync_with_stdio(0);
	// cin.tie(0), cout.tie(0);
	for(scanf("%d", &T); T--; ) {
		scanf("%d", &a);
		int x, y, s[10] = {}, ans = 0, z;
		rep(i, 1, a) {
			scanf("%d.%d", &x, &y);
			ans += x;
			if(y >= 5) ++ans;
			else ++s[y];
		}
		x = min(s[4], s[1]); s[4] -= x, s[1] -= x;
		ans += x;
		x = min(s[3], s[2]); s[3] -= x, s[2] -= x;
		ans += x;
		x = min(s[3], s[1] / 2); s[3] -= x, s[1] -= x * 2;
		ans += x;
		x = min(s[4], s[2]); s[4] -= x, s[2] -= x;
		ans += x;
		ans += (s[4] + s[3]) / 2;
		int mx = 0;
		rep(i, 0, s[1]) {
			if(s[2] < i * 2) break;
			x = min(s[2] - i * 2, (s[1] - i) / 3);
			int tmp = i + x + (s[1] - i - x * 3) / 5;
			mx = max(mx, tmp);
		}
		ans += mx;
		printf("%d\n", ans);
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}