#include <bits/stdc++.h>
const double eps = 1e-7, PI = 3.1415926;
const int N = 1e6;
using namespace std;
int n, m, k, a[N], b[7], sum, mx = -1, mn = 1e9;
char c[N];
string s;
vector<int> vec;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] == 4)
      b[0]++;
    else {
      if (a[i] == 8 && b[0] > b[1]) b[1]++;
      if (a[i] == 15 && b[1] > b[2]) b[2]++;
      if (a[i] == 16 && b[2] > b[3]) b[3]++;
      if (a[i] == 23 && b[3] > b[4]) b[4]++;
      if (a[i] == 42 && b[4] > b[5]) b[5]++;
    }
  }
  cout << n - (b[5] * 6);
  return 0;
}

### Prompt

Your task is to create 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>
const double eps = 1e-7, PI = 3.1415926;
const int N = 1e6;
using namespace std;
int n, m, k, a[N], b[7], sum, mx = -1, mn = 1e9;
char c[N];
string s;
vector<int> vec;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] == 4)
      b[0]++;
    else {
      if (a[i] == 8 && b[0] > b[1]) b[1]++;
      if (a[i] == 15 && b[1] > b[2]) b[2]++;
      if (a[i] == 16 && b[2] > b[3]) b[3]++;
      if (a[i] == 23 && b[3] > b[4]) b[4]++;
      if (a[i] == 42 && b[4] > b[5]) b[5]++;
    }
  }
  cout << n - (b[5] * 6);
  return 0;
}

```