#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 1e3 + 100;

int n;
int a[N], b[N];

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

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) scanf("%d", a + i);
        for (int i = 1; i <= n; i++) scanf("%d", b + i);
        for (int i = n; i >= 1; i--) {
            if (a[i] == 0 && b[i] == 0) continue;
            if (b[i] == 0) puts("1/0");
            else if (a[i] == 0) puts("0/1");
            else {
                int g = gcd(a[i], b[i]);
                a[i] /= g, b[i] /= g;
                printf("%d/%d\n", a[i], b[i]);
            }
            break;
        }
    }
    return 0;
}