#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<cstdlib>
#include<string>
#include<functional>
#include<list>
#include<stack>
using namespace std;
int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); }
int a[2][1010];
int main()
{
    //freopen("in.txt", "r", stdin);
    int t, n;
    cin >> t;
    while (t--) {
        cin >> n;
        for (int i = 0;i < 2;i++)
            for (int j = 1;j <= n;j++)
                scanf("%d", &a[i][j]);
        while (!a[0][n] && !a[1][n])n--;
        if (!a[0][n]) { cout << "0/1" << endl;continue; }
        if (!a[1][n]) { cout << "1/0" << endl;continue; }
        int m = gcd(a[0][n], a[1][n]);
        if (m > 1)cout << a[0][n] / m << "/" << a[1][n] / m << endl;
        else cout << a[0][n] << "/" << a[1][n] << endl;
    }
    return 0;
}