#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#define maxn 100000
using namespace std;
typedef long long ll;
typedef double dl;
bool p[maxn+1000]={0},o;
ll t[maxn+1000]={0,1},n,m,x,y,ans;
vector<ll> prime;
void Euler(){
	for (int i=2;i<=maxn;i++){
		if (p[i]==0) {
			prime.push_back(i);
			t[i]=t[i-1];
		}
		for (int j=0;j<prime.size();j++){
			if (prime[j]*i>maxn) break;
			p[prime[j]*i]=1;
			t[prime[j]*i]=t[prime[j]]+t[i];
			if (i%prime[j]==0) break;
		}
	}
	return;
}
int main(){
	freopen("alien.in","r",stdin);
	freopen("alien.out","w",stdout);
	Euler();
	//for (int i=0;i<prime.size();i++) printf("%d\n",prime[i]);
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&m);
		ans=1;
		o=0;
		for (int i=1;i<=m;i++){
			scanf("%lld%lld",&x,&y);
			if (x==2) o=1;
			ans+=t[x]*y;
		}
		printf("%lld\n",ans-o);
	}
	return 0;
}