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>
inline int in();
inline void wr(int);
inline int ch(int);
const int a[] = {4, 8, 15, 16, 23, 42};
const int N = (int)5e5 + 5;
int ju[6][N], tot[6] = {1, 1, 1, 1, 1, 1};
int main(int argc, char** argv) {
  register int n = in();
  for (register int i = 1; i <= n; ++i) {
    register int x = ch(in());
    if (x < 6) ju[x][++ju[x][0]] = i;
  }
  register int ans = 0;
  while (1) {
    register int last = ans + 6;
    if (last > n) break;
    for (register int i = 0; i < 5; ++i)
      while (ju[i][tot[i]] > ju[i + 1][tot[i + 1]] && tot[i + 1] < ju[i + 1][0])
        ++tot[i + 1];
    for (register int i = 0; i < 5; ++i)
      if (ju[i][tot[i]] > ju[i + 1][tot[i + 1]]) last -= 6;
    if (last <= ans) break;
    for (register int i = 0; i < 6; ++i) ++tot[i];
    ans = last;
  }
  wr(n - ans);
}
inline int ch(int x) {
  for (register int i = 0; i < 6; ++i)
    if (x == a[i]) return i;
  return 6;
}
inline int in() {
  register char c = getchar();
  register int x = 0, f = 1;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar())
    x = (x << 1) + (x << 3) + (c & 15);
  return x * f;
}
inline void wr(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x / 10) wr(x / 10);
  putchar(x % 10 + '0');
}
