#include <bits/stdc++.h>
using namespace std;

#define int long long
#define debug(x) cout<<#x<<" "<<x<<endl;

const int N=1e6+5;
const double eps=1e-9;
const int INF=1e18;

int n,T;
int f[N],g[N];

void solve()
{
    scanf("%I64d",&n);
    for(int i=1;i<=n;i++) scanf("%I64d",&f[i]);
    for(int i=1;i<=n;i++) scanf("%I64d",&g[i]);
    int tp1=n,tp2=n;
    while(f[tp1]==0&&tp1>1) tp1--;
    while(g[tp2]==0&&tp2>1) tp2--;
    if(tp1>tp2){
        puts("1/0");
    }
    else if(tp1<tp2){
        puts("0/1");
    }
    else{
        int G=__gcd(f[tp1],g[tp2]);
        f[tp1]/=G,g[tp2]/=G;
        cout<<f[tp1]<<"/"<<g[tp2]<<endl;
    }
}

signed main()
{
    //freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    scanf("%I64d",&T);
    while(T--) solve();
    return 0;
}