#include <stdio.h>
#include <algorithm>
using namespace std;
#define LIM 100011
 
int a[LIM];
int main() {
    int z;
    scanf("%d", &z);
    while (z--) {
        int n;
        scanf("%d", &n);
        for (int i = 0; i < n; i++) {
            scanf("%d", a + i);
        }
        sort(a, a + n);
        a[n] = a[n-1] + 2;
        int p = a[0]-2;
        int c = 0;
        int ans1 = 0, ans2 = 0;
        for (int i = 0; i <= n; i++) {
            if (p + 1 != a[i]) {
                ans1 += (c+2)/3;
                ans2 += (c+1)/2;
                c = 0;
            }
            c++;
            p = a[i];
        }
        printf("%d %d\n", ans1, ans2);
    }
}