#include<bits/stdc++.h>

using i64 = long long;


i64 exgcd(i64 a, i64 b, i64& x, i64& y) {
    if (a == 0) {
        x = 0, y = 1;
        return b;
    }
    i64 ret = exgcd(b % a, a, x, y), xx = x;
    x = y - b / a * x;
    y = xx; 
    return ret;
}

#ifdef LOCAL
#include "debugger.hpp"
#else
#define dbg(...)
#endif

std::mt19937 rnd(time(0));
std::mt19937_64 rnd64(time(0));

void solv() {
    int n;
    std::cin >> n;
    std::vector<i64> a(n), b(n);
    // i64 ans_m = rnd() % 100000 + 1, ans_k = rnd() % ans_m;
    // std::cerr << ans_m << ' ' << ans_k << '\n';
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
        // a[i] = rnd64() % 1000000;
        // a[i] = std::abs(a[i]) + 1;
        // std::cerr << a[i] << " \n"[i == n-1];
    }
    for (int i = 0; i < n; ++i) {
        std::cin >> b[i];
        // b[i] = (a[i] + ans_k) % ans_m;
        // std::cerr << b[i] << " \n"[i == n-1];
    }
    std::sort(b.begin(), b.end());

    auto check=[&](i64 m, i64 k) {
        std::vector<i64> c(n);
        for (int i = 0; i < n; ++i) {
            c[i] = (a[i] + k) % m;
        }
        std::sort(c.begin(), c.end());
        for (int i = 0; i < n; ++i) {
            if (b[i] != c[i]) return false;
        }
        return true;
    };
    auto weak_check=[&](i64 m, i64 k) {
        for (int i = 0; i < n; ++i) {
            if (!std::binary_search(b.begin(), b.end(), (a[i] + k) % m)) {
                return false;
            }
        }
        return true;
    };

    i64 min_m = *std::max_element(b.begin(), b.end()) + 1;
    i64 max_m = *std::max_element(a.begin(), a.end()) + 1;
    __int128_t sum_a = 0, sum_b = 0;
    for (int i = 0; i < n; ++i) {
        sum_a += a[i];
        sum_b += b[i];
    }
    for (i64 m = min_m; m <= max_m; ++m) {
        i64 k, _;
        i64 g = exgcd(n, m, k, _);
        i64 s = (sum_b - sum_a) % m;
        s = (s + m) % m;
        if (s % g) continue;
        i64 sg = s / g, mg = m / g;
        k = (k % mg + mg) % mg;
        for (i64 kk = (__int128_t(sg) * k) % mg; kk < m; kk += mg) {
            if (weak_check(m, kk) && check(m, kk)) {
                std::cout << m << ' ' << kk << '\n';
                return;
            }
        }
    }
}

signed main() {
    std::ios::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
    
    int tt = 1;
    // std::cin >> tt;
    while (tt--) {
        solv();
    }

    return 0;
}