#include <iostream>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <bitset>
#include <string>
#include <stack>
#include <time.h>
#include <unordered_set>
using namespace std;

#define ll long long
#define cin in
#define cout out
#define pii pair<int, int>
#define ld long double
#define u_set unordered_set

//ifstream in("input.txt");
//ofstream out("output.txt");

ifstream in("arithm.in");
ofstream out("arithm.out");

const int MAXN = 200000;

int n;
int nums[MAXN];
u_set<int> nums_set;

void input() {
    cin >> n;
    for (int i = 0; i < 2 * n; i++) {
        cin >> nums[i];
        nums_set.insert(nums[i]);
    }

    sort(nums, nums + 2 * n);
}

void part_case() {
    int prev = 0;
    for(int i = 0; i < 2*n; i++) {
        while(i+1 < 2*n && nums[i+1] == nums[i])
            i++;

        int cur = i - prev + 1;
        if(cur >= n) {
            cout << nums[i] << ' ' << 0;
            exit(0);
        }

        prev = i+1;
    }
}

void check(int pos, int d) {
    if(d == 0) return;

    int got = 1;
    int prev = nums[pos];

    int a = prev + d;

    while(nums_set.count(a)) {
        got++;
        a += d;
    }

    a = prev - d;

    while(nums_set.count(a)) {
        got++;
        a -= d;
    }

    if (got >= n) {
        cout << a+d << ' ' << d;
        exit(0);
    }
}

void gen_div(int a, int pos) {
    if (a == 0) {
        check(pos, 0);
        return;
    }

    for (int d = 1; d * d <= a; d++) {
        if (a % d == 0) {
            check(pos, d);
            check(pos, a / d);
        }
    }
}

int main()
{
    input();
    part_case();
    srand(time(0));

    int TRIES = 20000;

    while (TRIES--) {
        int a = rand() % (2 * n);
        int b = rand() % (2 * n);

        if (b > a)
            swap(a, b);

        gen_div(nums[a] - nums[b], b);
    }
}