#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) {};
};

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

pair<int, int> intersect(line a, line b) {
    int d = abs(__gcd((b.b - a.b), (a.k - b.k))), minus = (b.b < a.b ? -1 : 1);
    return {(b.b - a.b) / d * minus, (a.k - b.k) / d * minus};
}

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

bool good(pair<int, int> a) {
    return sign(a.first) == sign(a.second) && a.first != (int) 1e18;
}

int a[N], q[N], n, sz = 0;
pair<int, int> ans[N];
vector<line> st;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cin >> 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;
    for (int i = 0; i < n; i++) ord.emplace_back(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]);
        while (sz >= 1) {
            if (k.k < st[sz - 1].k || (sz >= 2 && intersectX(st[sz - 1], k) >=
                                                  intersectX(st[sz - 1], st[sz - 2])))
                st.pop_back(), sz--;
            else break;
        }
        st.emplace_back(k), sz++;
        if (a[q[i]] < a[i]) {
            line t = line(-(q[i] + 1), a[q[i]]);
            reverse(st.begin(), st.end());
            for (int j = 0; j < (int) st.size(); j++) {
                auto left = (j > 0 ? intersectX(st[j], st[j - 1]) : -1e18),
                        right = (j + 1 < (int) st.size() ? intersectX(st[j], st[j + 1]) : 1e18);
                if (intersectX(st[j], t) < 0) continue;
                if (left <= intersectX(st[j], t) && intersectX(st[j], t) <= right) {
                    ans[i] = intersect(st[j], t);
                    break;
                }
            }
            reverse(st.begin(), st.end());
        }
    }
    st.clear(), sz = 0;
    reverse(ord.begin(), ord.end());
    for (int i: ord) {
        line k = line(-(i + 1), a[i]);
        while (sz >= 1) {
            if (k.k > st[sz - 1].k || (sz >= 2 && intersectX(st[sz - 1], k) <=
                                                  intersectX(st[sz - 1], st[sz - 2])))
                st.pop_back(), sz--;
            else break;
        }
        st.emplace_back(k), sz++;
        if (a[q[i]] > a[i]) {
            line t = line(-(q[i] + 1), a[q[i]]);
            reverse(st.begin(), st.end());
            for (int j = 0; j < (int) st.size(); j++) {
                auto left = (j > 0 ? intersectX(st[j], st[j - 1]) : -1e18),
                        right = (j + 1 < (int) st.size() ? intersectX(st[j], st[j + 1]) : 1e18);
                if (intersectX(st[j], t) < 0) continue;
                if (left <= intersectX(st[j], t) && intersectX(st[j], t) <= right) {
                    ans[i] = intersect(st[j], t);
                    break;
                }
            }
            reverse(st.begin(), st.end());
        }
    }
    for (int i = 0; i < n; i++) {
        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;
}