#include <bits/stdc++.h>
using namespace std;
vector<string> split(const string& s, char c) {
  vector<string> v;
  stringstream ss(s);
  string x;
  while (getline(ss, x, c)) v.emplace_back(x);
  return move(v);
}
template <typename T, typename... Args>
inline string arrStr(T arr, int n) {
  stringstream s;
  s << "[";
  for (int i = 0; i < n - 1; i++) s << arr[i] << ",";
  s << arr[n - 1] << "]";
  return s.str();
}
inline void __evars_begin(int line) { cerr << "#" << line << ": "; }
template <typename T>
inline void __evars_out_var(vector<T> val) {
  cerr << arrStr(val, val.size());
}
template <typename T>
inline void __evars_out_var(T* val) {
  cerr << arrStr(val, 10);
}
template <typename T>
inline void __evars_out_var(T val) {
  cerr << val;
}
inline void __evars(vector<string>::iterator it) { cerr << endl; }
template <typename T, typename... Args>
inline void __evars(vector<string>::iterator it, T a, Args... args) {
  cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
  __evars_out_var(a);
  cerr << "; ";
  __evars(++it, args...);
}
const long long nmax = 1000 * 1007;
struct edge {
  long long a, b, cost;
  edge(long long x, long long y, long long z) : a(x), b(y), cost(z){};
};
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long n;
long long v[200010];
map<long long, long long> mp;
long long dp[200010];
long long fnMin(long long idx) {
  if (idx > n) return 0;
  long long& cache = dp[idx];
  if (cache != -1) return cache;
  if (!mp[idx])
    cache = fnMin(idx + 1);
  else
    cache = 1 + min(fnMin(idx + 2), fnMin(idx + 3));
  return cache;
}
long long fnMax() {
  long long ans = 0, cur = -1e18;
  for (long long i = (long long)(0); i <= (long long)(n - 1); i++) {
    if (v[i] - 1 > cur)
      ans++, cur = v[i] - 1;
    else if (v[i] > cur)
      ans++, cur = v[i];
    else if (v[i] + 1 > cur)
      ans++, cur = v[i] + 1;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  memset(dp, -1, sizeof(dp));
  cin >> n;
  for (long long i = 0; i < (long long)(n); i++) {
    cin >> v[i];
    mp[v[i]]++;
  }
  sort(v, v + n);
  cout << fnMin(0) << " " << fnMax() << endl;
  return 0;
}
