#include <bits/stdc++.h>
int main() {
  int n;
  int k4, k8, k15, k16, k23, k42;
  int x;
  std::cin >> n;
  k4 = 0;
  k8 = 0;
  k15 = 0;
  k16 = 0;
  k23 = 0;
  k42 = 0;
  for (int i = 0; i < n; ++i) {
    std::cin >> x;
    if (x == 4) {
      ++k4;
    } else if (x == 8 && k8 < k4) {
      ++k8;
    } else if (x == 15 && k15 < k8) {
      ++k15;
    } else if (x == 16 && k16 < k15) {
      ++k16;
    } else if (x == 23 && k23 < k16) {
      ++k23;
    } else if (x == 42 && k42 < k23) {
      ++k42;
    }
  }
  if (k42 > 0) {
    std::cout << n - 6 * k42;
  } else {
    std::cout << n;
  }
  return 0;
}

### Prompt

Create a solution in CPP for 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>
int main() {
  int n;
  int k4, k8, k15, k16, k23, k42;
  int x;
  std::cin >> n;
  k4 = 0;
  k8 = 0;
  k15 = 0;
  k16 = 0;
  k23 = 0;
  k42 = 0;
  for (int i = 0; i < n; ++i) {
    std::cin >> x;
    if (x == 4) {
      ++k4;
    } else if (x == 8 && k8 < k4) {
      ++k8;
    } else if (x == 15 && k15 < k8) {
      ++k15;
    } else if (x == 16 && k16 < k15) {
      ++k16;
    } else if (x == 23 && k23 < k16) {
      ++k23;
    } else if (x == 42 && k42 < k23) {
      ++k42;
    }
  }
  if (k42 > 0) {
    std::cout << n - 6 * k42;
  } else {
    std::cout << n;
  }
  return 0;
}

```