#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#define INF 1000000007
using namespace std;

int s[550],T,n;
int main()
{
    //freopen("Input.txt","r",stdin);
    scanf("%d", &T);
    while(T--)
    {
        memset(s,0,sizeof(s));
        scanf("%d", &n);
        int a,b;
        for(int i = 0; i < n; i++)
        {
            scanf("%d%d",&a,&b);
            s[a] += b;
        }
        int cnt = 0;
        for(int i = 1; i <= 500; i++)
        {
            if(s[i] % 64 != 0)
            {
                cnt += (s[i]/64 + 1);
            }
            else
            {
                cnt += s[i]/64;
            }
        }
        if(cnt % 36 != 0)
        {
            printf("%d\n",cnt/36+1);
        }
        else
        {
            printf("%d\n",cnt/36);
        }
    }
    return 0;
}