#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, mx = 0, p, min;
  map<int, list<int>> m;
  map<int, list<int>>::iterator itr;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> k;
    m[k].push_back(i);
  }
  list<int>::iterator it;
  min = k = m[4].size();
  int b[] = {0, 4, 8, 15, 16, 23, 42};
  int a[7][k];
  for (int i = 0; i < k; i++) a[0][i] = 0;
  for (int i = 1; i < 7; i++) {
    p = b[i];
    it = m[p].begin();
    for (int j = 0; j < min; j++) {
      while (*it < a[i - 1][j] && it != m[p].end()) it++;
      if (it == m[p].end()) {
        min = j;
        break;
      } else {
        a[i][j] = *it;
      }
      it++;
    }
  }
  n = n - 6 * min;
  cout << n;
}

### 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() {
  int n, k, mx = 0, p, min;
  map<int, list<int>> m;
  map<int, list<int>>::iterator itr;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> k;
    m[k].push_back(i);
  }
  list<int>::iterator it;
  min = k = m[4].size();
  int b[] = {0, 4, 8, 15, 16, 23, 42};
  int a[7][k];
  for (int i = 0; i < k; i++) a[0][i] = 0;
  for (int i = 1; i < 7; i++) {
    p = b[i];
    it = m[p].begin();
    for (int j = 0; j < min; j++) {
      while (*it < a[i - 1][j] && it != m[p].end()) it++;
      if (it == m[p].end()) {
        min = j;
        break;
      } else {
        a[i][j] = *it;
      }
      it++;
    }
  }
  n = n - 6 * min;
  cout << n;
}

```