#include <bits/stdc++.h>
using namespace std;
class MYCP {
 public:
  static const long long MOD_CONST_ATCODER = 1000 * 1000 * 1000 + 7;
  static long long DebugFlag;
  static string MakeString_LongLong(vector<long long> const& numbers,
                                    string const& str) {
    if (numbers.size() == 0) return "";
    string result = "" + to_string(numbers[0]);
    for (long long i = 1; i < numbers.size(); i++) {
      result += str;
      result += to_string(numbers[i]);
    }
    return result;
  }
  static string MakeString_LongLong(vector<long long> const& numbers) {
    if (numbers.size() == 0) return "";
    string result = "" + to_string(numbers[0]);
    for (long long i = 1; i < numbers.size(); i++) {
      result += " ";
      result += to_string(numbers[i]);
    }
    return result;
  }
  static string MakeString_VectorString(vector<string> const& str) {
    string result = "";
    for (long long i = 0; i < str.size(); i++) {
      result += str[i] + "\n";
    }
    return result;
  }
  static vector<string> MyReadLineSplit(long long n) {
    vector<string> str(n);
    for (long long i = 0; i < n; i++) {
      std::cin >> str[i];
    }
    return str;
  }
  static vector<long long> ReadInts(long long number) {
    vector<long long> a(number);
    for (int i = 0; i < number; i++) {
      std::cin >> a[i];
    }
    return a;
  }
  static bool PrimeCheck_Int(long long number) {
    if (number < 2) return false;
    for (unsigned long long i = 2; i * i <= number; i++) {
      if (number % i == 0) return false;
    }
    return true;
  }
  static vector<long long> MakePrimeList(long long n) {
    vector<long long> list;
    long long i, j, p;
    bool flag;
    for (i = 2; i <= n; i++) {
      flag = true;
      for (j = 0; j < list.size(); j++) {
        if (!(list[j] * list[j] <= i)) break;
        if (i % list[j] == 0) {
          flag = false;
          break;
        }
      }
      if (flag) list.push_back(i);
    }
    return list;
  }
  static vector<string> split(string const& str, char sep) {
    vector<std::string> v;
    auto first = str.begin();
    while (first != str.end()) {
      auto last = first;
      while (last != str.end() && *last != sep) last++;
      v.push_back(string(first, last));
      if (last != str.end()) last++;
      first = last;
    }
    return v;
  }
  static long long Sum(vector<long long> a) {
    long long i, sum = 0;
    for (i = 0; i < a.size(); i++) {
      sum += a[i];
    }
    return sum;
  }
  static bool Komoji(char a) {
    if (a >= 'a' && a <= 'z') return true;
    return false;
  }
  static bool Oomoji(char a) {
    if (a >= 'A' && a <= 'Z') return true;
    return false;
  }
  static long long KiriageWarizan(long long a, long long b) {
    long long result = a / b;
    if (a % b > 0) result++;
    return result;
  }
  static long long GreatestCommonFactor(long long a, long long b) {
    long long temp;
    if (a < b) {
      temp = b;
      b = a;
      a = temp;
    }
    while (true) {
      temp = a % b;
      a = b;
      b = temp;
      if (b == 0) break;
    }
    return a;
  }
  static long long LeastCommonMultiple(long long a, long long b) {
    return (a / GreatestCommonFactor(a, b)) * b;
  }
  static vector<vector<long long> > PrimeFactorization(long long n) {
    vector<long long> p_list, s_list;
    long long i, j, k, count;
    for (i = 2; n > 1; i++) {
      if (i * i > n) {
        p_list.push_back(n);
        s_list.push_back(1);
        break;
      }
      if (n % i == 0) {
        count = 0;
        while (n % i == 0) {
          n /= i;
          count++;
        }
        p_list.push_back(i);
        s_list.push_back(count);
      }
    }
    vector<vector<long long> > result;
    result.push_back(p_list);
    result.push_back(s_list);
    return result;
  }
  static long long Combination(long long n, long long r) {
    r = min(r, n - r);
    vector<long long> p(n + 1, 0);
    long long i, j, k, a, b, c;
    for (i = 1; i <= r; i++) {
      auto temp = MYCP::PrimeFactorization(i);
      for (j = 0; j < temp[0].size(); j++) {
        p[temp[0][j]] -= temp[1][j];
      }
      a = i + n - r;
      temp = MYCP::PrimeFactorization(a);
      for (j = 0; j < temp[0].size(); j++) {
        p[temp[0][j]] += temp[1][j];
      }
    }
    long long result = 1;
    for (i = 0; i < p.size(); i++) {
      if (p[i] > 0) {
        for (j = 0; j < p[i]; j++) {
          result *= i;
          result %= MYCP::MOD_CONST_ATCODER;
        }
      }
    }
    return result;
  }
  static long long sign(long long x) {
    if (x > 0) return 1;
    if (x < 0) return -1;
    return 0;
  }
  static double PI() { return (double)3.1415926535898; }
  static void CoutDoubleKeta(double a, long long keta) {
    cout << setprecision(keta) << a << flush;
  }
  static void CoutVectorLL(vector<long long> list) {
    long long i, j, k, n;
    n = list.size();
    for (i = 0; i < n - 1; i++) {
      cout << list[i] << " ";
    }
    cout << list[n - 1] << flush;
  }
  static long long DebugPrintf(string output) {
    if (MYCP::DebugFlag != 0) {
      std::cout << output << endl;
    }
    return MYCP::DebugFlag;
  }
  static long long DebugCin() {
    long long a;
    if (MYCP::DebugFlag != 0) {
      cin >> a;
    }
    return a;
  }
};
long long MYCP::DebugFlag = 0;
class Ruisekiwa {
 private:
  vector<long long> list;

 public:
  void MakeArray(vector<long long> data) {
    long long i;
    list = data;
    list.push_back(0);
    list[0] = 0;
    for (i = 1; i < list.size(); i++) {
      list[i] = list[i - 1] + data[i - 1];
    }
  }
  long long Sum(long long start, long long end) {
    if (end < start) {
      std::cout << "startがendより大きいです";
      return 0;
    }
    if (start < 0 || end >= list.size()) {
      std::cout << "範囲が異常";
      return 0;
    }
    return list[end] - list[start];
  }
};
class N_Number {
 public:
  N_Number(long long n, long long keta) {
    this->N_Shinsuu = n;
    vector<long long> temp(keta, 0);
    this->numbers = temp;
  }
  void plus(long long a) {
    if (a < 0) {
      a *= (-1);
      this->minus(a);
      return;
    }
    this->numbers[0] += a;
    long long size = this->numbers.size();
    for (long long i = 0; i < size; i++) {
      if (i + 1 < size) {
        this->numbers[i + 1] += this->numbers[i] / this->N_Shinsuu;
      }
      this->numbers[i] %= this->N_Shinsuu;
    }
  }
  long long check() {
    long long a = this->numbers[0];
    for (long long i = 0; i < this->numbers.size(); i++) {
      if (this->numbers[i] != a) return -1;
    }
    return a;
  }
  long long getNumber(long long keta) { return this->numbers[keta]; }
  long long getKeta() { return this->numbers.size(); }
  long long getShinsuu() { return this->N_Shinsuu; }
  void setNumber(long long keta, long long number) {
    if (0 <= number && number < this->getShinsuu()) {
      if (0 <= keta && keta < this->getKeta()) {
        this->numbers[keta] = number;
        return;
      }
    }
    cout << "er" << endl;
  }
  void setAllNumbers(long long number) {
    long long size = this->getKeta(), i;
    for (i = 0; i < size; i++) {
      this->setNumber(i, number);
    }
  }
  string to_string_KetaSoroe() {
    string s = "";
    for (long long i = this->getKeta() - 1; i >= 0; i--) {
      s += to_string(this->getNumber(i));
    }
    return s;
  }

 private:
  void minus(long long a) {
    long long i, j, k, zettaiti = abs(a);
    k = MYCP::KiriageWarizan(zettaiti, this->N_Shinsuu);
    j = k * (this->N_Shinsuu - 1);
    for (i = 0; i < this->getKeta(); i++) {
      this->numbers[i] += j;
    }
    this->numbers[0] += k - a;
    this->plus(0);
  }
  vector<long long> numbers;
  long long N_Shinsuu;
};
class Union_Find {
 private:
  vector<long long> tree;
  vector<long long> count;
  long long root(long long a) {
    if (this->tree[a] == a) return a;
    return this->tree[a] = this->root(this->tree[a]);
  }

 public:
  Union_Find(long long n) {
    vector<long long> set(n);
    this->tree = set;
    this->count = set;
    for (long long i = 0; i < n; i++) {
      this->tree[i] = i;
      this->count[i] = 1;
    }
  }
  void unite(long long a, long long b) {
    long long x, y;
    if (!this->Check(a, b)) {
      x = this->getCount(a) + getCount(b);
      y = this->root(a);
      this->count[y] = x;
      y = this->root(b);
      this->count[y] = x;
    }
    x = this->root(a);
    y = this->root(b);
    this->tree[x] = y;
  }
  bool Check(long long a, long long b) {
    return this->root(a) == this->root(b);
  }
  long long getCount(long long index) {
    long long temp = this->root(index);
    return this->count[temp];
  }
};
bool opeA(vector<long long> x, vector<long long> y) { return x[0] < y[0]; }
int main(void) {
  MYCP::DebugFlag = 1;
  long long i, j, k, n, m;
  cin >> n;
  auto a = MYCP::ReadInts(n);
  vector<long long> count(1000, 0);
  for (i = 0; i < n; i++) {
    count[a[i] / 400]++;
  }
  long long ans = 0;
  for (i = 0; i < 8; i++) {
    if (count[i]) ans++;
  }
  k = 0;
  for (i = 8; i < count.size(); i++) {
    k += count[i];
  }
  cout << max((long long)1, ans) << " " << flush;
  cout << min((long long)8, ans + k) << endl;
  return 0;
}
