#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

int a[64];

pair<int, int> solve(int sum, int num) {
    for (int i = 0; i <= num; i++) {
        if (i*2+(num-i)*4 == sum) {
            return make_pair(i, num-i);
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) cin >> a[i];
    int turu = 0, kame = 0;
    for (int i = 0; i < N; i++) {
        auto ans = solve(a[i], N-1);
        turu += ans.first; kame += ans.second;
    }
    turu /= N-1; kame /= N-1;
    cout << turu << " " << kame << endl;
    return 0;
}