#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 1e18;
//const int mod = 2600000069;
//const int p = 179;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(all(a));
    int ans = 0;
    map<int, int> used;
    for (int i = 0; i < n; i++) {
        if (used[a[i]]) continue;
        else {
            used[a[i]] = used[a[i] + 1] = used[a[i] + 2] = 1;
            ans++;
        }
    }
    cout << ans << ' ';
    ans = 0;
    used.clear();
    for (int i = 0; i < n; i++) {
        if (!used[a[i] - 1]) {
            used[a[i] - 1] = 1;
            ans++;
        } else if (!used[a[i]]) {
            used[a[i]] = 1;
            ans++;
        } else if (!used[a[i] + 1]) {
            used[a[i] + 1] = 1;
            ans++;
        }
    }
    cout << ans;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int q = 1;
//    cin >> q;
    while (q--) solve();
}
/*
*/