#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int gcd(int a,int b)
{
    if(!b)return a;
    return gcd(b,a%b);
}
int T,n,a[10010],b[10010],na,nb,g;
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=0;i<n;++i)scanf("%d",&a[i]);
        for(int i=0;i<n;++i)scanf("%d",&b[i]);
        na=nb=n;
        while(!a[na-1])--na;
        while(!b[nb-1])--nb;
        if(na>nb)printf("1/0\n");
        else if(na<nb)printf("0/1\n");
        else g=gcd(a[na-1],b[nb-1]),printf("%d/%d\n",a[na-1]/g,b[nb-1]/g);
    }
    return 0;
}