#include <bits/stdc++.h>

using namespace std;
#define int long long

const int N = (int) 1e5 * 2 + 10;

struct line {
    int k, b;

    line() : k(0), b(0) {};

    line(int _k, int _b) : k(_k), b(_b) {};

    int get(int x) const {
        return k * x + b;
    }
};

pair<int, int> intersectX(line a, line b) {
    int d = abs(__gcd(b.b - a.b, a.k - b.k));
    return {(b.b - a.b) / d, (a.k - b.k) / d};
}

long double intersectXinDouble(line a, line b) {
    return (long double) (b.b - a.b) / (long double) (a.k - b.k);
}

pair<int, int> ans[N];
deque<line> st;
int sz = 0;

void add_line(line k) {
    while (sz >= 2) {
        if (k.k < st[0].k || intersectXinDouble(st[0], st[1]) <=
                             intersectXinDouble(st[0], k))
            st.pop_front(), sz--;
        else break;
    }
    st.push_front(k), sz++;
}

void add_line1(line k) {
    while (sz >= 2) {
        if (k.k > st[0].k || intersectXinDouble(st[0], st[1]) >=
                             intersectXinDouble(st[0], k))
            st.pop_front(), sz--;
        else break;
    }
    st.push_front(k), sz++;
}

int sign(int x) {
    return (x >= 0 ? 1 : -1);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int n;
    cin >> n;
    int a[n], q[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> q[i], q[i]--;
    for (int i = 0; i < n; i++) ans[i] = {(int) 1e18, (int) 1e18};
    vector<int> ord(n);
    for (int i = 0; i < n; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), [&](int i, int j) {
        return a[i] < a[j];
    });
    reverse(ord.begin(), ord.end());
    for (int i: ord) {
        line k = line(-(i + 1), a[i]);
        add_line(k);
        if (a[q[i]] < a[i]) {
            line t = line(-(q[i] + 1), a[q[i]]);
            int l = 0, r = sz;
            while (r - l > 1) {
                int mid = (l + r) / 2;
                if ((mid > 0 ? intersectXinDouble(st[mid - 1], st[mid]) : -1e18) <=
                    intersectXinDouble(t, st[mid]))
                    l = mid;
                else r = mid;
            }
            ans[i] = intersectX(t, st[l]);
        }
    }
    st.clear(), sz = 0;
    reverse(ord.begin(), ord.end());
    for (int i: ord) {
        line k = line(-(i + 1), a[i]);
        add_line1(k);
        if (a[q[i]] > a[i]) {
            line t = line(-(q[i] + 1), a[q[i]]);
            int l = 0, r = sz;
            while (r - l > 1) {
                int mid = (l + r) / 2;
                if ((mid > 0 ? intersectXinDouble(st[mid - 1], st[mid]) : -1e18) <=
                    intersectXinDouble(t, st[mid]))
                    l = mid;
                else r = mid;
            }
            ans[i] = intersectX(t, st[l]);
        }
    }
    for (int i = 0; i < n; i++) {
        if (sign(ans[i].first) < 0) ans[i].first *= -1, ans[i].second *= -1;
        if (ans[i].first == (int) 1e18 || sign(ans[i].first) != sign(ans[i].second)) cout << "-1\n";
        else cout << ans[i].first << "/" << ans[i].second << "\n";
    }
    return 0;
}