#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

long long A[501],B[501],numere,m;
int n,k,P[15000],desc[15000];
bool X[31361];

void functie(int care,int in,int sf,int cate,int orig,long long div)
{
    if(cate==0)
    {
        if(orig%2==0)
        {
            numere=numere+A[care]/div;
        }
        else numere=numere-A[care]/div;
    }
    else
    {
        int i;
        for(i=in;i<=sf-cate+1;i++)
        {
            functie(care,i+1,sf,cate-1,orig,div*desc[i]);
        }
    }
}
int main()
{
    int i,j;
    FILE *f=fopen("pinex.in","r");
    FILE *g=fopen("pinex.out","w");
    fscanf(f,"%d",&n);
    for(i=1;i<=n;i++)
    {
        fscanf(f,"%I64d%I64d",&A[i],&B[i]);
        m=max(m,B[i]);
    }
    m=int(sqrt(m))+1;
    for(i=2;i<=m;i++)
    {
        if(X[i]==false)
        {
            for(j=2;j<=m/i;j++)
            {
                X[i*j]=true;
            }
        }
    }
    for(i=2;i<=m;i++)
    {
        if(!X[i])
            k++,P[k]=i;
    }
    for(i=1;i<=n;i++)
    {
        numere=A[i];
        j=1;
        desc[0]=0;
        while(j<=k || B[i]!=1)
        {
            if(B[i]%P[j]==0)
            {
                desc[0]++;
                desc[desc[0]]=P[j];
                while(B[i]%P[j]==0)
                    B[i]/=P[j];
            }
            j++;
        }
        if(j>k && B[i]!=1)
        {
            desc[0]++;
            desc[desc[0]]=B[i];
        }
        for(j=1;j<=desc[0];j++)
            functie(i,1,desc[0],j,j,1);
        fprintf(g,"%I64d\n",numere);
    }
    return 0;
}