// Go in my style.
// Not afraid to dark.

#include <bits/stdc++.h>
using namespace std;

clock_t sttime;
#define STCLOCK sttime = clock();
#define TIMENOW fprintf(stderr, "\nNOW TIME COSSEMED: %0.4lf\n", 1.0 * (clock() - sttime) / CLOCKS_PER_SEC);
#define inline __inline__ __attribute__ ((always_inline))

#define int __int128

namespace io {
    int pos;
    inline int read(int &p = pos) {
        static bool v; static char c;
        p = 0, v = false, c = getchar();
        while (! isdigit(c)) {
            if (c == '-') v = true;
            c = getchar();
        }
        while (isdigit(c)) {
            p = (p << 1) + (p << 3) + (c - 48);
            c = getchar();
        }
        return p = v ? - p : p;
    }
    inline void write(int x) {
        static int sta[65], top; top = 0;
        if (x < 0) putchar('-'), x = - x;
        do sta[++ top] = x % 10, x /= 10;
        while (x);
        while (top) putchar(sta[top --] + 48);
    }
}

const int N = 2e5;
int n, m, k, a[N + 5], b[N + 5], c[N + 5], s;

pair<int, int> exg(int a, int b) {
    if (!a) return {0, 1};
    if (!b) return {1, 0};
    auto res = exg(b, a % b);
    return {res.second, res.first - a / b * res.second};
}

map<int, int> mp;
inline bool Check(int m, int k) {
    for (int i = 1, w; i <= n; ++ i) {
        w = (a[i] + k) % m;
        if (!mp[w]) {
            for (int j = 1; j < i; ++ j) ++ mp[(a[j] + k) % m];
            return false;
        }
        -- mp[w];
    }
    for (int i = 1; i <= n; ++ i) ++ mp[(a[i] + k) % m];
    return true;
}

signed main() {
    STCLOCK

    io::read(n);
    for (int i = 1; i <= n; ++ i) s -= io::read(a[i]);
    for (int i = 1; i <= n; ++ i) s += io::read(b[i]), ++ mp[b[i]];
    sort(a + 1, a + n + 1);
    sort(b + 1, b + n + 1);
    for (m = b[n] + 1; ; ++ m) {
        int g = __gcd(n, m);
        if (s % g != 0) continue;
        int rnd = m / g; k = exg(n, m).first % rnd;
        k = (k * (s / g) % rnd + rnd) % rnd;
        while (k < m) {
            if (Check(m, k)) {
                io::write(m), putchar(' ');
                io::write(k), putchar('\n');
                TIMENOW
                return 0;
            }
            k += rnd;
        }
    }

    puts("NO FOUND!");

    TIMENOW
    return 1;
}