#include <bits/stdc++.h>
using namespace std;
queue<int> q1, q2, q3, q4, q5, q6;
int main() {
  int n, x, ans = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    if (x == 4)
      q1.push(i);
    else if (x == 8)
      q2.push(i);
    else if (x == 15)
      q3.push(i);
    else if (x == 16)
      q4.push(i);
    else if (x == 23)
      q5.push(i);
    else
      q6.push(i);
  }
  if (q1.empty() || q2.empty() || q3.empty() || q4.empty() || q5.empty() ||
      q6.empty()) {
    printf("%d\n", n - ans);
    return 0;
  }
  while (1) {
    if (q2.front() > q1.front()) {
      if (q3.front() > q2.front()) {
        if (q4.front() > q3.front()) {
          if (q5.front() > q4.front()) {
            if (q6.front() > q5.front()) {
              ans += 6;
              q1.pop();
              q2.pop();
              q3.pop();
              q4.pop();
              q5.pop();
              q6.pop();
            } else
              q6.pop();
          } else
            q5.pop();
        } else
          q4.pop();
      } else
        q3.pop();
    } else
      q2.pop();
    if (q1.empty() || q2.empty() || q3.empty() || q4.empty() || q5.empty() ||
        q6.empty())
      break;
  }
  printf("%d\n", n - ans);
  return 0;
}
