#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
template<class T> inline void read(T &x){
    x=0; char c=getchar(); int f=1;
    while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
    while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
template<class T> inline void umin(T &x, T y){x=x<y?x:y;}
template<class T> inline void umax(T &x, T y){x=x>y?x:y;}
inline ui R() {
    static ui seed=416;
    return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
const int N = 233333;
int n,m,a[N],b[N];
int gcd(int a,int b){return !b?a:gcd(b,a%b);}
int main() {
    int T;read(T);while(T--){
        read(n);m=n;
        rep(i,1,n)read(a[i]);
        rep(i,1,n)read(b[i]);
        while(!a[n])n--;while(!b[m])m--;
        if(n>m)puts("1/0");
        else if(n<m)puts("0/1");
        else printf("%d/%d\n",a[n]/gcd(a[n],b[m]),b[m]/gcd(a[n],b[m]));
    }
    return 0;
}