#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using S = string;
using vs = vector<string>;
using P = pair<int, int>;
using vp = vector<P>;
using ull = unsigned long long;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
const int INF = 1001001001;
const int mod = 1000000007;
struct mint {
  ll x;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
struct UF {
  vector<int> r;
  UF(int N) { r = vector<int>(N, -1); }
  int root(int x) {
    if (r[x] < 0) return x;
    return r[x] = root(r[x]);
  }
  bool same(int x, int y) { return root(x) == root(y); }
  bool unite(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y) return false;
    if (r[x] > r[y]) swap(x, y);
    r[x] += r[y];
    r[y] = x;
    return true;
  }
  int size(int x) { return -r[root(x)]; }
};
vector<int> sosuu(100001);
vector<int> estora(vector<int> num) {
  int sel = 0;
  while (sel < num.size()) {
    int d = num[sel];
    for (int i = 0; i < num.size(); i++) {
      if (num[i] % d == 0 && num[i] != d && d != 1) {
        num.erase(num.begin() + i);
        i--;
      }
    }
    sel++;
  }
  for (int i = 0; i < num.size(); i++) {
    sosuu[num[i]] = 1;
  }
  return num;
}
int gcd(int x, int y) {
  int num[3];
  num[0] = (x > y) ? x : y;
  num[1] = (x <= y) ? x : y;
  num[2] = num[0] % num[1];
  while (num[2]) {
    num[0] = num[1];
    num[1] = num[2];
    num[2] = num[0] % num[1];
  }
  return num[1];
}
ll ans = 1;
vector<P> fac(ll n, ll youso) {
  ll kazu = n;
  vector<P> num(0);
  for (int i = 2; i <= sqrt(n); i++) {
    P kari;
    kari.first = i;
    int kai = 0;
    while (1) {
      if (kazu % i != 0) break;
      kazu /= i;
      kari.second++;
      kai++;
    }
    ans *= pow(i, kai / youso);
    if (kari.second != 0) num.emplace_back(kari);
  }
  if (n != 1) num.emplace_back(P(kazu, 1));
  return num;
  return num;
}
bool IsPrime(int num) {
  if (num < 2)
    return false;
  else if (num == 2)
    return true;
  else if (num % 2 == 0)
    return false;
  double sqrtNum = sqrt(num);
  for (int i = 3; i <= sqrtNum; i += 2) {
    if (num % i == 0) {
      return false;
    }
  }
  return true;
}
int pow_kai(int a, int n) {
  int x = 1;
  while (n > 0) {
    if (n & 1) {
      x = x * a;
    }
    a = a * a;
    n >>= 1;
  }
  return x;
}
mint chooes(int n, int a) {
  mint x = 1, y = 1;
  for (int i = 0; i < a; i++) {
    x *= n - i;
    y *= i + 1;
  }
  return x / y;
}
int main() {
  int n;
  cin >> n;
  vi a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  vi table(8);
  int sum = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] >= 3200) {
      sum++;
    } else {
      table[a[i] / 400]++;
    }
  }
  int ans = 0;
  for (int i = 0; i < 8; i++) {
    if (table[i]) ans++;
  }
  if (ans == 0 && sum != 0) ans++;
  cout << ans << " " << ans + sum << endl;
  return 0;
}
