#include<bits/stdc++.h> 
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ll long long
#define fi first
#define se second
#define PB push_back
#define uint unsigned
#define ull unsigned ll 
using namespace std;

const int N=1000005;
int n,a[N],b[N]; 
int gcd(int x,int y){
    return y?gcd(y,x%y):x;
}
void solve(){
    scanf("%d",&n);
    For(i,1,n) scanf("%d",&a[i]);
    For(i,1,n) scanf("%d",&b[i]);
    reverse(a+1,a+n+1);
    reverse(b+1,b+n+1);
    For(i,1,n)
        if (a[i]||b[i]){
            int G=gcd(a[i],b[i]);
            printf("%d/%d\n",a[i]/G,b[i]/G);
            return;
        }
    puts("0/0n");
} 
int main(){
    int T;
    scanf("%d",&T);
    while (T--) solve();
}