hdoj1896 //纯属纪念--自己完成的优先队列

#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;


struct node{
int pi,di;
friend bool operator < (const node a,const node b) {
if(a.pi == b.pi)
return a.di > b.di;
return a.pi > b.pi;
}
};


int main(){
int t;
int a,b;
while(cin>>t){
for(int i = 0;i<t;++i){
int n; priority_queue<node> que; node q;
cin>>n;
for(int j = 0;j<n;++j){
cin>>a>>b;
q.pi = a;
q.di = b;
que.push(q);
}
int ok = 1; int max = -1;
while(que.size()){
q = que.top();
que.pop();
if(max < q.pi)
max = q.pi;
if(ok % 2 == 0){
++ok;
continue;}
++ok;
q.pi += q.di;
que.push(q);
}
cout<<max<<endl;
}
}
return 0;
}