# include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
long long a[maxn],b[maxn],x[maxn],t[maxn];
void solve()
{
    long long n,i;
    cin>>n;
    long long d;
    long long sum = 0;
    for(i=1;i<=n;i++)
    {
        cin>>x[i];
        if(i==1)d=x[i];
        else
            d = __gcd(d,x[i]);
    }
   // cout<<d<<endl;
    long long p =d;
    for(i=1;i<=n;i++)
    {
        cin>>a[i]>>b[i];
        x[i]/=p;
        sum+=x[i];
        t[i] = (unsigned long long)(b[i]/__gcd(b[i],x[i]));
        //t[i] = t[i]/x[i];
        if(i==1)d=  t[i];
        else
            d = (t[i]/(__gcd(t[i],d)))*d;
    }
    unsigned long long mins = 1e18;
    for(i=1;i<=n;i++)
    {
         unsigned long long k = (d*x[i])/b[i];
        if(a[i]<k){cout<<-1<<endl;return ;}

        k = a[i]/k;
        mins= min(mins,k);
    }
    cout<<(unsigned long long)d*sum<<" "<<(unsigned long long)mins*d*sum<<endl;
}
int main()
{
freopen ("alchemy.in", "r", stdin);
freopen ("alchemy.out", "w" , stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin>>t;
    while(t--)
        solve();
    return 0;
}