#include <bits/stdc++.h>
#define db double
using namespace std;

struct o
{
  int zh, xi;
  bool operator < (const o &a) const
  {
    return xi < a.xi;
  }
};
int T, n;
bool vis[1000005];
o a[1000005];

/*
*/
bool cmp(o x, o y)
{
  return (x.xi != y.xi ? x.xi < y.xi : x.zh < y.zh);
}
void solve()
{
  o w = {0, 0};
  priority_queue <o> q; 
  scanf("%d", &n);
  for (int i(1); i <= n; i ++) {
    db t; scanf("%lf", &t); 
    t *= 10;
    a[i].zh = (int)(t / 10);
    a[i].xi = (int)t % 10;
    vis[i] = 0;
  }
  sort (a + 1, a + 1 + n, cmp);
  for (int i(1); i <= n && a[i].xi <= 2; i ++) {
    o tp = {0, 5 - a[i].xi};
    int l = lower_bound(a + 1, a + 1 + n, tp) - a;
    if (a[l].xi + a[i].xi == 5) {
      vis[l] = vis[i] = 1;
      w.zh += (a[l].zh + a[i].zh) + (a[l].xi + a[i].xi + 5) / 10;
    }
  }
  for (int i(1); i <= n; i ++) 
    if (!vis[i]) q.push(a[i]);
  while (q.size()) {
    o u = q.top(); q.pop();
    // printf("u: %d.%d\n", u.zh, u.xi);
    if (w.xi >= 5) 
      w.zh += 1, w.xi = 0;
    if (u.xi < 5) {
      if (u.xi + w.xi >= 5) {
        w.zh += u.zh + (w.xi + u.xi + 5) / 10;
        w.xi = 0;
      }
      else {
        w.zh += u.zh + (w.xi + u.xi) / 10;
        w.xi = (w.xi + u.xi) % 10;
      }
    }
    else 
      w.zh += u.zh + (u.xi + 5)/10;
    // printf("w: %d.%d\n", w.zh, w.xi);
  }
  w.zh += (w.xi + 5) / 10;
  printf("%d\n", w.zh);
}
int main()
{
  // freopen("test.out", "w", stdout);
  scanf("%d", &T);
  while (T --) solve();

  return 0;
}
/*
1
5
6.9 1.9 8.3 0.9 8.6
*/