#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#define inf 0x3f3f3f3f
#define ll long long
#define maxn 200005
#define mod 1000000007
using namespace std;
int gcd(int a,int b)
{
    return a==0?b:gcd(b%a,a);
}
int a[1000006];
int b[1000006];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,i;
        cin>>n;
        for(i=1;i<=n;i++)
        {
          scanf("%d",&a[i]);
        }
        for(i=1;i<=n;i++)
        {
            scanf("%d",&b[i]);
        }
        int k1=n;
        int k2=n;
        while(a[k1]==0)
            k1--;
        while(b[k2]==0)
            k2--;
        if(k1>k2)
        printf("%d/%d\n",1,0);
        else if(k1<k2)
            printf("%d/%d\n",0,1);
        else{
            int ans=gcd(a[k1],b[k2]);

        printf("%d/%d\n",a[k1]/ans,b[k2]/ans);

        }

    }
    return 0;
}