#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int cnt[505];
int main()
{
    int T,i,j,a,b,n,e,ans;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        memset(cnt,0,sizeof cnt);
        for(i=1;i<=n;i++)
        {
            scanf("%d%d",&a,&b);
            cnt[a]+=b;
        }
        ans = 0;
        E:
        e = 36;
        for(i=0;i<505 && e > 0;i++)
        {
            if(cnt[i] == 0)continue;
            else
            {
                if(cnt[i] < 64)e--,cnt[i] = 0;
                else
                {
                    int t = cnt[i] / 64 , r = cnt[i] % 64;
                    if(e >= t)
                    {
                        e -= t,cnt[i] = r;
                        if(e >= 1)e--,cnt[i] = 0;else break;
                    }
                    else
                    {
                        cnt[i] -= e * 64;
                        e = 0;
                        break;
                    }
                }
            }
        }
        if(e == 0)
        {
            ans++;
            goto E;
        }
        else
        {
            if(e == 36)printf("%d\n",ans);
            else printf("%d\n",ans + 1);
        }
    }
    return 0;
}