#include <bits/stdc++.h>
using namespace std;
long long maxd(long long a, long long b) {
  if (a >= b) {
    return a;
  }
  return b;
}
long long mind(long long a, long long b) {
  if (a <= b) {
    return a;
  }
  return b;
}
long long gcd(long long a, long long b) {
  if (a < b) {
    swap(a, b);
  }
  while (b) {
    long long r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int isPrim(int a) {
  if (a == 1) {
    return 0;
  }
  for (int i = 2; i <= (a + 1) / 2; i++) {
    if (a % i == 0) {
      return 0;
    }
  }
  return 1;
}
long long mod_pow(long long x, long long n, long long mod) {
  long long ret = 1;
  while (n > 0) {
    if (n % 2 == 1) {
      ret = (ret * x) % mod;
    }
    x = (x * x) % mod;
    n = n / 2;
  }
  return ret;
}
struct XX {
  long long a;
  int i;
};
class xxIntu {
 public:
  bool operator()(const XX& riLeft, const XX& riRight) const {
    if ((riLeft.a) == (riRight.a)) {
      return riLeft.i < riRight.i;
    }
    return (riLeft.a) < (riRight.a);
  }
};
class xxGreater {
 public:
  bool operator()(const XX& riLeft, const XX& riRight) const {
    if ((riLeft.a) == (riRight.a)) {
      return riLeft.i > riRight.i;
    }
    return (riLeft.a) > (riRight.a);
  }
};
int main(int argc, const char* argv[]) {
  int N;
  cin >> N;
  int a[100];
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  int c[9];
  for (int i = 0; i < 9; i++) {
    c[i] = 0;
  }
  for (int i = 0; i < N; i++) {
    if (a[i] >= 3200) {
      c[0]++;
    } else if (a[i] >= 2800) {
      c[1]++;
    } else if (a[i] >= 2400) {
      c[2]++;
    } else if (a[i] >= 2000) {
      c[3]++;
    } else if (a[i] >= 1600) {
      c[4]++;
    } else if (a[i] >= 1200) {
      c[5]++;
    } else if (a[i] >= 800) {
      c[6]++;
    } else if (a[i] >= 400) {
      c[7]++;
    } else if (a[i] >= 1) {
      c[8]++;
    }
  }
  int ans = 0;
  for (int i = 1; i < 9; i++) {
    if (c[i] != 0) {
      ans++;
    }
  }
  cout << ans << " " << ans + c[0] << endl;
  return 0;
}
