#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<vector>
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<=i##_end_;i++)
#define dwn(i,a,b) for(int i=(a),i##_end_=(b);i>=i##_end_;i--)
using namespace std;
inline int read() {
    int x=0,f=1;char c=getchar();
    for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=getchar()) x=x*10+c-'0';
    return x*f;
}
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1010;
int gcd(int a,int b) {return !b?a:gcd(b,a%b);}
void solve() {
    int n=read(),f1=0,f2=0,p1,p2;
    rep(i,1,n) {
        int x=read();
        if(x) f1=x,p1=i;
    }
    rep(i,1,n) {
        int x=read();
        if(x) f2=x,p2=i;
    }
    if(p1==p2) printf("%d/%d\n",f1/gcd(f1,f2),f2/gcd(f1,f2));
    else if(p1>p2) printf("1/0\n");
    else printf("0/1\n");
}
int main() {
    int T=read();
    while(T--) solve();
    return 0;
}