#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cctype>
 
#include <algorithm>
#include <random>
#include <bitset>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <vector>
#include <chrono>
#include <iostream>
#include <limits>
#include <numeric>
 
#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1010;

int n, m;
int f[N], g[N];

int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }

void solve() {
  scanf("%d", &n);
  --n;
  for (int i = 0; i <= n; ++i)
    scanf("%d", &f[i]);
  m = n;
  for (int i = 0; i <= m; ++i)
    scanf("%d", &g[i]);
  while (!f[n]) --n;
  while (!g[m]) --m;
  if (n > m) {
    puts("1/0");
  } else if (n < m)
    puts("0/1");
  else {
    int x = gcd(f[n], g[m]);
    printf("%d/%d\n", f[n] / x, g[m] / x);
  }
}

int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}