#include <bits/stdc++.h>
#define F(i,x,y) for(int i=(x);i<=(y);i++)
#define DF(i,x,y) for(int i=(x);i>=(y);i--)
#define ms(x,y) memset(x,y,sizeof(x))
#define SZ(x) (int)x.size()-1
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int,int> pii;
template<typename T> void chkmax(T &x,T y){ x=max(x,y);}
template<typename T> void chkmin(T &x,T y){ x=min(x,y);}
template<typename T> void read(T &FF){
    FF=0;int RR=1;char ch=getchar();
    for(;!isdigit(ch);ch=getchar()) if(ch=='-') RR=-1;
    for(;isdigit(ch);ch=getchar()) FF=(FF<<1)+(FF<<3)+ch-48;
    FF*=RR;
}
const int N=200010;
int n,a[N],q[N];
void print(int X,int Y){
    int t=gcd(X,Y);X/=t,Y/=t;
    printf("%d/%d\n",X,Y);
}
#define fi first
#define se second
void Min(pii &pt1,pii pt2){ if(pt1.fi==-1||1ll*pt1.fi*pt2.se>1ll*pt2.fi*pt1.se) pt1=pt2;}
void Max(pii &pt1,pii pt2){ if(pt1.fi==-1||1ll*pt1.fi*pt2.se<1ll*pt2.fi*pt1.se) pt1=pt2;}
struct fenwick1{
    #define lowbit(x) x&-x
    pii tr[N];
    void clr(){ F(i,1,n) tr[i]={-1,-1};}
    void ins(int x,pii pt){ for(;x<=n;x+=lowbit(x)) Min(tr[x],pt);}
    pii ask(int x){ pii ret={-1,-1};for(;x;x-=lowbit(x)) Min(ret,tr[x]);return ret;}
}fwk1;
struct fenwick2{
    #define lowbit(x) x&-x
    pii tr[N];
    void clr(){ F(i,1,n) tr[i]={-1,-1};}
    void ins(int x,pii pt){ for(;x<=n;x+=lowbit(x)) Max(tr[x],pt);}
    pii ask(int x){ pii ret={-1,-1};for(;x;x-=lowbit(x)) Max(ret,tr[x]);return ret;}
}fwk2;
int id[N];
pii ans[N];
int main(){
    read(n);
    F(i,1,n) read(a[i]);
    F(i,1,n) read(q[i]);
    F(i,1,n) id[i]=i;
    sort(id+1,id+n+1,[&](int x,int y){ return a[x]>a[y];});
    fwk1.clr();
    F(i,1,n){
        int ID=id[i];
        fwk1.ins(n-ID+1,{a[ID],ID});
        if(a[q[ID]]<a[ID]){
            if(ID<q[ID]){
                pii pt=fwk1.ask(n-q[ID]+1);
                if(pt.fi==-1) ans[ID]={-1,-1};
                else ans[ID]={pt.fi-a[q[ID]],pt.se-q[ID]};
            }
            else{
                pii pt=fwk1.ask(n-ID+1);
                ans[ID]={pt.fi-a[q[ID]],pt.se-q[ID]};
            }
        }
    }
    F(i,1,n){
        if(i<q[i]){
            int X=-1,Y=-1;
            if(a[q[i]]>a[i]){
                X=a[q[i]]-a[i],Y=q[i]-i;
                F(j,1,i-1) if(a[j]<a[i])
                    if(X==-1||1ll*X*(q[i]-j)>1ll*(a[q[i]]-a[j])*Y) X=a[q[i]]-a[j],Y=q[i]-j;
                ans[i]={X,Y};
            }
            // else{
            //     F(j,q[i]+1,n) if(a[j]>a[i])
            //         if(X==-1||1ll*X*(j-q[i])>1ll*(a[j]-a[q[i]])*Y) X=a[j]-a[q[i]],Y=j-q[i];
            // }
        }
        else{
            if(a[i]>a[q[i]]){
                // X=a[i]-a[q[i]],Y=i-q[i];
                // F(j,i+1,n) if(a[j]>a[i])
                //     if(X==-1||1ll*X*(j-q[i])>1ll*(a[j]-a[q[i]])*Y) X=a[j]-a[q[i]],Y=j-q[i];
            }
            else{
                int X=-1,Y=-1;
                F(j,1,q[i]-1) if(a[j]<a[i])
                    if(X==-1||1ll*X*(q[i]-j)>1ll*(a[q[i]]-a[j])*Y) X=a[q[i]]-a[j],Y=q[i]-j;
                ans[i]={X,Y};
            }
        }
    }
    F(i,1,n){
        if(ans[i].fi==-1) puts("-1");
        else print(ans[i].fi,ans[i].se);
    }
    return 0;
}