#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using namespace std;
bool isPrimeNum(ll x) {
  if (x <= 1) {
    return false;
  }
  int n = (int)sqrt((double)x);
  for (int i = 2; i <= n; i++) {
    if (x % i == 0) {
      return false;
    }
  }
  return true;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(int a, int b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
  if (a >= b) return a - b;
  if (a < b) return b - a;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
  ll N, K;
  cin >> N;
  ll a[N];
  ll ans = 0;
  ll sum = 0;
  for (int i = (0); i <= (N - 1); i++) {
    cin >> a[i];
  }
  ll c1 = 0;
  ll c2 = 0;
  ll c3 = 0;
  ll c4 = 0;
  ll c5 = 0;
  ll c6 = 0;
  ll c7 = 0;
  ll c8 = 0;
  ll c9 = 0;
  for (int i = (0); i <= (N - 1); i++) {
    if (a[i] < 400) {
      c1 = 1;
    } else if (a[i] <= 800) {
      c2 = 1;
    } else if (a[i] <= 1200) {
      c3 = 1;
    } else if (a[i] <= 1600) {
      c4 = 1;
    } else if (a[i] <= 2000) {
      c5 = 1;
    } else if (a[i] <= 2400) {
      c6 = 1;
    } else if (a[i] <= 2800) {
      c7 = 1;
    } else if (a[i] <= 3200) {
      c9 = 1;
    } else {
      c8++;
    }
  }
  ans = c1 + c2 + c3 + c4 + c5 + c6 + c7 + c8 + c9;
  cout << ans << endl;
  return 0;
}
