You are given an array a consisting of n integers. Each a_i is one of the six following numbers: 4, 8, 15, 16, 23, 42.

Your task is to remove the minimum number of elements to make this array good.

An array of length k is called good if k is divisible by 6 and it is possible to split it into k/6 subsequences 4, 8, 15, 16, 23, 42.

Examples of good arrays:

  * [4, 8, 15, 16, 23, 42] (the whole array is a required sequence); 
  * [4, 8, 4, 15, 16, 8, 23, 15, 16, 42, 23, 42] (the first sequence is formed from first, second, fourth, fifth, seventh and tenth elements and the second one is formed from remaining elements); 
  * [] (the empty array is good). 



Examples of bad arrays: 

  * [4, 8, 15, 16, 42, 23] (the order of elements should be exactly 4, 8, 15, 16, 23, 42); 
  * [4, 8, 15, 16, 23, 42, 4] (the length of the array is not divisible by 6); 
  * [4, 8, 15, 16, 23, 42, 4, 8, 15, 16, 23, 23] (the first sequence can be formed from first six elements but the remaining array cannot form the required sequence). 

Input

The first line of the input contains one integer n (1 ≤ n ≤ 5 ⋅ 10^5) — the number of elements in a.

The second line of the input contains n integers a_1, a_2, ..., a_n (each a_i is one of the following numbers: 4, 8, 15, 16, 23, 42), where a_i is the i-th element of a.

Output

Print one integer — the minimum number of elements you have to remove to obtain a good array.

Examples

Input


5
4 8 15 16 23


Output


5


Input


12
4 8 4 15 16 8 23 15 16 42 23 42


Output


0


Input


15
4 8 4 8 15 16 8 16 23 15 16 4 42 23 42


Output


3
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0;
  char ch = getchar();
  bool f = 0;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = 1;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  return f ? -x : x;
}
void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
void writeln(long long x) {
  write(x);
  puts("");
}
const int N = 500005;
int n, a[N], c[N];
const int b[7] = {0, 4, 8, 15, 16, 23, 42};
bool used[N];
queue<int> q[105];
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read(), q[a[i]].push(i);
  for (int i = 1; i <= n; i++)
    if (!used[i]) {
      bool d = 1;
      int opt = 0;
      for (int j = 1; j <= 6; j++) {
        if (!q[b[j]].size()) {
          d = 0;
          break;
        }
        bool f = 0;
        while (q[b[j]].size()) {
          if (q[b[j]].front() > c[opt]) {
            c[++opt] = q[b[j]].front();
            q[b[j]].pop();
            f = 1;
            break;
          }
          q[b[j]].pop();
        }
        if (!f) {
          d = 0;
          break;
        }
      }
      if (d)
        for (int j = 1; j <= opt; j++) used[c[j]] = 1;
      else
        break;
    }
  int ans = n;
  for (int i = 1; i <= n; i++) ans -= used[i];
  write(ans);
  return 0;
}
