#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
using namespace std;

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

void process()
{
    int n;
    cin >> n;
    vector<int> f(n), g(n);

    for (int i = 0; i < n; ++i) {
        cin >> f[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> g[i];
    }


    for (int i = n - 1; i >= 0; --i) {
        if (f[i] == 0 && g[i] == 0) continue;

        /*
        if (f[i] == 0) {
            cout << "0/1" << endl;
            return;
        }
        if (g[i] == 0) {
            cout << "1/0" << endl;
            return;
        }
        */

        int r = gcd(f[i], g[i]);
        cout << f[i]/r << '/' << g[i]/r << endl;
        break;
    }
}

int main(void)
{
    int T;
    cin >> T;
    for (int i = 1; i <= T; ++i)
    {
        process();
    }
    return 0;
}