#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
inline int readInt() {
  int x;
  scanf("%d", &x);
  return x;
}
struct Edge {
  int to, cost;
  Edge(int to, int cost) : to(to), cost(cost) {}
};
vector<vector<Edge>> graph;
const int INF = 100000000;
int a, b, c, d, e, f;
bool used[500010];
int main() {
  int n;
  cin >> n;
  vector<int> v(n);
  int cnt = 0;
  for (int i = 0; i < (int)n; ++i) {
    cin >> v[i];
    if (v[i] == 4) a++;
    if (v[i] == 8) b++;
    if (v[i] == 15) c++;
    if (v[i] == 16) d++;
    if (v[i] == 23) e++;
    if (v[i] == 42) f++;
    if (a < b) {
      cnt++;
      b--;
    } else if (a < c) {
      cnt++;
      c--;
    } else if (a < d) {
      cnt++;
      d--;
    } else if (a < e) {
      cnt++;
      e--;
    } else if (a < f) {
      cnt++;
      f--;
    } else if (b < c) {
      cnt++;
      c--;
    } else if (b < d) {
      cnt++;
      d--;
    } else if (b < e) {
      cnt++;
      e--;
    } else if (b < f) {
      cnt++;
      f--;
    } else if (c < d) {
      cnt++;
      d--;
    } else if (c < e) {
      cnt++;
      e--;
    } else if (c < f) {
      cnt++;
      f--;
    } else if (d < e) {
      cnt++;
      e--;
    } else if (d < f) {
      cnt++;
      f--;
    } else if (e < f) {
      cnt++;
      f--;
    }
  }
  cnt = cnt + abs(b - f) + abs(c - f) + abs(d - f) + abs(e - f) + abs(f - a);
  cout << cnt << endl;
  return 0;
}
