#include <bits/stdc++.h>
using namespace std;
set<int> pos[100];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, x, cnt = 0;
  cin >> n;
  vector<int> a = {4, 8, 15, 16, 23, 42};
  for (int i = 1; i <= n; ++i) {
    cin >> x;
    pos[x].insert(i);
  }
  int last = 0, my_pos = 0;
  while (1) {
    if ((int)pos[a[last]].size() == 0) break;
    auto it = pos[a[last]].lower_bound(my_pos);
    if (it == pos[a[last]].end()) break;
    my_pos = (*it);
    pos[a[last]].erase(my_pos);
    last++;
    if (last == 6) {
      cnt++;
      last = 0;
      my_pos = 0;
    }
  }
  cout << n - 6 * cnt << '\n';
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

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;
set<int> pos[100];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, x, cnt = 0;
  cin >> n;
  vector<int> a = {4, 8, 15, 16, 23, 42};
  for (int i = 1; i <= n; ++i) {
    cin >> x;
    pos[x].insert(i);
  }
  int last = 0, my_pos = 0;
  while (1) {
    if ((int)pos[a[last]].size() == 0) break;
    auto it = pos[a[last]].lower_bound(my_pos);
    if (it == pos[a[last]].end()) break;
    my_pos = (*it);
    pos[a[last]].erase(my_pos);
    last++;
    if (last == 6) {
      cnt++;
      last = 0;
      my_pos = 0;
    }
  }
  cout << n - 6 * cnt << '\n';
  return 0;
}

```