#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
struct edge {
  int to, cost;
};
int A[102], B[8] = {}, C, N, W, H, ans = 0, dp[10000][10000];
string S;
static const int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
                 dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
void solve() {
  for (int i = 0; i < N; ++i) {
    if (A[i] / 400 <= 7) {
      B[(A[i] / 400)]++;
    }
  }
  for (int i = 0; i < 8; ++i) {
    if (B[i] > 0) ans++;
  }
}
void debug() {}
void answer() {
  if (!ans) ans = 1;
  cout << ans << "\n";
}
int main() {
  cin >> N;
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }
  solve();
  debug();
  answer();
  return 0;
}
