#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int s[43] = {0};
  int c = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == 4) {
      s[4]++;
    }
    if (a[i] == 8) {
      if (s[4] > 0) {
        s[4]--;
        s[8]++;
      } else
        c++;
    }
    if (a[i] == 15) {
      if (s[8] > 0) {
        s[8]--;
        s[15]++;
      } else
        c++;
    }
    if (a[i] == 16) {
      if (s[15] > 0) {
        s[15]--;
        s[16]++;
      } else
        c++;
    }
    if (a[i] == 23) {
      if (s[16] > 0) {
        s[16]--;
        s[23]++;
      } else
        c++;
    }
    if (a[i] == 42) {
      if (s[23] > 0) {
        s[23]--;
        s[42]++;
      } else
        c++;
    }
  }
  int ans = c;
  ans += s[23] * 5;
  ans += s[16] * 4;
  ans += s[15] * 3;
  ans += s[8] * 2;
  ans += s[4];
  cout << ans;
}

### 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;
int main() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int s[43] = {0};
  int c = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == 4) {
      s[4]++;
    }
    if (a[i] == 8) {
      if (s[4] > 0) {
        s[4]--;
        s[8]++;
      } else
        c++;
    }
    if (a[i] == 15) {
      if (s[8] > 0) {
        s[8]--;
        s[15]++;
      } else
        c++;
    }
    if (a[i] == 16) {
      if (s[15] > 0) {
        s[15]--;
        s[16]++;
      } else
        c++;
    }
    if (a[i] == 23) {
      if (s[16] > 0) {
        s[16]--;
        s[23]++;
      } else
        c++;
    }
    if (a[i] == 42) {
      if (s[23] > 0) {
        s[23]--;
        s[42]++;
      } else
        c++;
    }
  }
  int ans = c;
  ans += s[23] * 5;
  ans += s[16] * 4;
  ans += s[15] * 3;
  ans += s[8] * 2;
  ans += s[4];
  cout << ans;
}

```