#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;

int a[505];

void Deal_with() {
    int n,T;
    scanf("%d",&T);
    while(T--) {
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        int tempa,tempb;
        for(int i = 1 ; i <= n ; i++) {
            scanf("%d %d",&tempa,&tempb);
            a[tempa] += tempb;
        }
        int ans = 0;
        for(int i = 1 ; i <= 500 ; i++) {
            ans += (a[i] + 63) / 64;
        }
        printf("%d\n",(ans+35)/36);
    }
} 

int main(void) {
    // freopen("a.in","r",stdin);
    Deal_with();
    return 0;
}