#include<bits/stdc++.h>
#define endl '\n'
#define f first
#define s second
using namespace std;
typedef long long ll;
ll i,j,p,q,t,n,m,k,x[200006],mi,ma,sum,Min;
bool fl;
pair <ll,ll> a[200006];
ll gcd(ll a, ll b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);

}
int main()
{
    freopen("alchemy.in","r",stdin);
    freopen("alchemy.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //cout<<gcd(3,6)<<endl;
    cin>>t;
    while(t--)
    {
        cin>>n;p=0;fl=0;sum=0;Min=999999999999999999;
        mi=0;
        for(i=1;i<=n;i++)
        {
            cin>>x[i];
            p=gcd(x[i],p);
            //cout<<p<<endl;
        }
        //cout<<p<<endl;
        for(i=1;i<=n;i++)
        {
            x[i]/=p;

            sum+=x[i];
        }

        for(i=1;i<=n;i++)
        {
            cin>>a[i].f>>a[i].s;
            if(x[i]>a[i].f*a[i].s)
            {
                //cout<<i<<endl;
                fl=1;
            }
        }
        if(fl==1)
        {
            cout<<-1<<endl;
            continue;
        }
        //cout<<1111<<endl;
        ma=0;
        for(i=1;i<=n;i++)
        {
            p=(a[i].s*x[i])/(gcd(x[i],a[i].s));
            p/=x[i];
            if(ma==0)
                ma=p;
            else
                ma=(ma*p)/(gcd(ma,p));
            if((ma*x[i])/a[i].s>a[i].f)
            {
                fl=1;
                break;
            }
        }
        if(fl==1)
        {
            cout<<-1<<endl;
            continue;
        }
        //cout<<ma<<" "<<sum<<endl;
        for(i=1;i<=n;i++)
        {
            p=(ma*x[i])/a[i].s;
            Min=min(Min,a[i].f/p);
        }
        if(Min==0)
        {
            cout<<-1<<endl;
            continue;
        }
        mi=Min*ma;
        mi*=sum;
        ma*=sum;
        cout<<ma<<" "<<mi<<endl;
        ///mi e max

    }
    return 0;
}
/**
3
3
3 5 8
18 2
12 5
16 6
3
2 4 6
1 1
1 2
1 3
2
3 5
1 5
1 3
*/