#include<bits/stdc++.h>
using namespace std;
vector<int>a;
int main(){
    int T; scanf("%d", &T);
    while (T--){
        int n; scanf("%d",&n);
        a.clear();
        for (int i=1;i<=n;i++){
            int x,y;
            scanf("%d%d",&x,&y);
            if (x==1) a.push_back(y); else a.push_back(y+1);
        }
        /*sort(a[0].begin(), a[0].end());
        sort(a[1].begin(), a[1].end());
        int ans=0;
        for (int i=0;i<a[0].size();i++)
            ans=max(ans, (int)a[0].size()-i+a[0][i]);
        for (int i=0;i<a[1].size();i++)
            ans=max(ans, (int)a[1].size()-i+2+a[1][i]);*/
        sort(a.begin(), a.end());
        int ans=0;
        int need=1,step=0;
        for (int i=a.size()-1;i>=0;i--){
            if (step&1) ++need; ++step;
            ans=max(ans, need+a[i]);
        }
        printf("%d\n",ans);
    }
}