#include <bits/stdc++.h>

using namespace std;
#define int long long

pair<int, int> get1(int a1, int i1, int a2, int i2) {
    int minus = 1, d = abs(__gcd(a1 - a2, i1 - i2));
    if (a1 - a2 < 0) minus = -1;
    return {((a1 - a2) / d) * minus, ((i1 - i2) / d) * minus};
}

bool smaller(pair<int, int> p, pair<int, int> q) {
    if (q.first == (int) 1e18) return true;
    return p.first * q.second < q.first * p.second;
}

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

bool good(pair<int, int> p) {
    return sign(p.first) == sign(p.second);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) {
        int q;
        cin >> q;
        q--;
        pair<int, int> res = {(int) 1e18, (int) 1e18};
        if (good(get1(a[i], i, a[q], q))) res = get1(a[i], i, a[q], q);
        for (int j = 0; j < n; j++) {
            if (j == i || j == q) continue;
            pair<int, int> p1 = get1(a[i], i, a[j], j), p2 = get1(a[j], j, a[q], q);
            if (good(p1) && good(p2) && smaller(p1, p2) && smaller(p2, res)) res = p2;
        }
        if (res.first == (int) 1e18) cout << "-1\n";
        else cout << res.first << "/" << res.second << '\n';
    }
    return 0;
}