#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int n, i, num;
  int answer = 0;
  int A[6] = {0};
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &num);
    if (num == 4)
      A[0]++;
    else if (num == 8 && A[0] > A[1])
      A[1]++;
    else if (num == 15 && A[1] > A[2])
      A[2]++;
    else if (num == 16 && A[2] > A[3])
      A[3]++;
    else if (num == 23 && A[3] > A[4])
      A[4]++;
    else if (num == 42 && A[4] > A[5])
      A[5]++;
  }
  sort(A, A + 6);
  answer = n - 6 * A[0];
  printf("%d", answer);
}

### Prompt

Your challenge is to write a cpp solution to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int n, i, num;
  int answer = 0;
  int A[6] = {0};
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &num);
    if (num == 4)
      A[0]++;
    else if (num == 8 && A[0] > A[1])
      A[1]++;
    else if (num == 15 && A[1] > A[2])
      A[2]++;
    else if (num == 16 && A[2] > A[3])
      A[3]++;
    else if (num == 23 && A[3] > A[4])
      A[4]++;
    else if (num == 42 && A[4] > A[5])
      A[5]++;
  }
  sort(A, A + 6);
  answer = n - 6 * A[0];
  printf("%d", answer);
}

```