#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define maxn 1010
using namespace std;
typedef long long ll;
int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
    while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int T;
int a[maxn],b[maxn];
int n;
int main()
{
    T=read();
    while(T--)
    {
        n=read();
        for(int i=0;i<n;i++)  a[i]=read();
        for(int i=0;i<n;i++)  b[i]=read();
        int pos1=n-1,pos2=n-1;
        while(!a[pos1])  pos1--;
        while(!b[pos2])  pos2--;
        if(pos1>pos2)  puts("1/0");
        if(pos1<pos2)  puts("0/1");
        if(pos1==pos2){
            int g=__gcd(a[pos1],b[pos2]);
            printf("%d/%d\n",a[pos1]/g,b[pos2]/g);
        }
    }
    return 0;
}