/*
* @Author: NanoApe
* @Date:   2019-08-17 17:59:32
* @Last Modified by:   NanoApe
* @Last Modified time: 2019-08-17 18:24:49
*/

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>

using namespace std;

#define rep(i, l, r) for(int i=l; i<=r; i++)
#define dow(i, l, r) for(int i=l; i>=r; i--)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define clr(x, c) memset(x,c,sizeof(x))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;

inline int read()
{
    int x=0,f=0; char ch=getchar();
    while (ch<'0' || '9'<ch) f|=ch=='-', ch=getchar();
    while ('0'<=ch && ch<='9') x=x*10+ch-'0', ch=getchar();
    return f?-x:x;
}

#define maxn 1009

int a[maxn], b[maxn];

int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a%b); }

int main()
{
    int T = read();
    while (T--) {
        int n = read();
        rep(i, 1, n) a[i]=read();
        rep(i, 1, n) b[i]=read();
        int G = n; while (G > 1 && a[G] == 0 && b[G] == 0) G--;
        if (a[G] == 0) puts("0/1");
        else if (b[G] == 0) puts("1/0");
        else printf("%d/%d\n", a[G]/gcd(a[G],b[G]), b[G]/gcd(a[G],b[G]));
    }
}