#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 20
using namespace std;
int n,m[N],a[N],m1;
int read()
{
    int x=0,f=1; char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1; ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘; ch=getchar();}
    return x*f;
}
int exgcd(int a,int b,int &x,int &y)
{
    if(b==0)
    {
        x=1,y=0;
        return a;
    }
    int r=exgcd(b,a%b,x,y),tmp;
    tmp=x,x=y,y=tmp-a/b*y;
    return r;
}
int crt()
{
    int a1=a[1],a2,m2,d,c;m1=m[1];
    for(int i=2;i<=n;++i)
    {
        a2=a[i],m2=m[i];
        c=a2-a1;int x=0,y=0;
        d=exgcd(m1,m2,x,y);
        if(c%d) return  -1;
        x=x*c/d;
        int mod=m2/d;
        x=(mod+x%mod)%mod;
        a1+=m1*x;m1*=mod;
    }
    if(a1==0) a1+=m1;
    return  a1;
}
int main()
{
    int t,tot=0;
    t=read();
    while(t--)
    {
        n=read();
        for(int i=1;i<=n;++i) m[i]=read();
        for(int i=1;i<=n;++i) a[i]=read();
        printf("Case %d: %d\n",++tot,crt());
    }
    return 0;
}