#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; ++i) cin >> a[i];
  long long c4 = 0, c8 = 0, c15 = 0, c16 = 0, c23 = 0, c42 = 0;
  long long ans = 0;
  for (auto i : a) {
    if (i == 4) c4++;
    if (i == 8) {
      if (c4 > 0) {
        c4--;
        c8++;
      } else
        ans++;
    }
    if (i == 15) {
      if (c8 > 0) {
        c8--;
        c15++;
      } else
        ans++;
    }
    if (i == 16) {
      if (c15 > 0) {
        c15--;
        c16++;
      } else
        ans++;
    }
    if (i == 23) {
      if (c16 > 0) {
        c16--;
        c23++;
      } else
        ans++;
    }
    if (i == 42) {
      if (c23 > 0) {
        c23--;
        c42++;
      } else
        ans++;
    }
  }
  cout << ans + c4 + c8 * 2 + c15 * 3 + c16 * 4 + c23 * 5;
  return 0;
}

### Prompt

Please create a solution in cpp 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;
int32_t main() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; ++i) cin >> a[i];
  long long c4 = 0, c8 = 0, c15 = 0, c16 = 0, c23 = 0, c42 = 0;
  long long ans = 0;
  for (auto i : a) {
    if (i == 4) c4++;
    if (i == 8) {
      if (c4 > 0) {
        c4--;
        c8++;
      } else
        ans++;
    }
    if (i == 15) {
      if (c8 > 0) {
        c8--;
        c15++;
      } else
        ans++;
    }
    if (i == 16) {
      if (c15 > 0) {
        c15--;
        c16++;
      } else
        ans++;
    }
    if (i == 23) {
      if (c16 > 0) {
        c16--;
        c23++;
      } else
        ans++;
    }
    if (i == 42) {
      if (c23 > 0) {
        c23--;
        c42++;
      } else
        ans++;
    }
  }
  cout << ans + c4 + c8 * 2 + c15 * 3 + c16 * 4 + c23 * 5;
  return 0;
}

```