#include <bits/stdc++.h>
// #define int long long
#define vi vector<int>
#define ii pair<int, int>
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define P 31
#define mod 1'000'000'007
#define inf 1'000'000'000'000'000'000
#define pb push_back
#define str string
#define sz(x) (x).size()
#define vvi vector<vi>
#define fun function
#define oopt cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
#define file freopen("problemname.in", "r", stdin); freopen("pr.out", "w", stdout);
#define dbg(v) cout << "Line(" << __LINE__ << ") -> " << #v << " = " << (v) << endl;
using namespace std;
template <class T, int SZ> using arr = array<T, SZ>;
void solve()
{
int n;
cin >> n;
vi a(n);
for (int&v:a)
cin >> v;
sort(all(a));
int j=n-1;
int ste=0;
vi vel;
while (j>=0)
{
ste++;
int tr=a[j];
int oldj=j;
j-=a[j];
if (j<-1)
{
ste--;
tr=oldj+1;
int dl = tr/ste;
sort(all(vel));
for (int i = 0; i+1 < vel.size(); i++)
{
if (tr<0)
break;
int mozno = vel[i+1]-vel[i];
tr-=(i+1)*mozno;
}
if (tr>0)
{
int dl =tr/ste+(tr%ste?1:0);
vel.back()+=dl;
}
break;
}
vel.pb(tr);
}
sort(all(vel));
cout<< ste <<" " <<vel.back()<<"\n";
}
int main()
{
oopt;
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
