#include <bits/stdc++.h>
using namespace std;
const long long int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int inf = 1e9 + 66555;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return ((a * b) / gcd(b, a));
}
long long int conv(long long int x) {
  if (x == 4) return 0;
  if (x == 8) return 1;
  if (x == 15) return 2;
  if (x == 16) return 3;
  if (x == 23) return 4;
  return 5;
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    a[i] = conv(x);
  }
  vector<long long int> ans(6);
  for (long long int i = 0; i < n; i++) {
    if (a[i] == 0) {
      ans[0]++;
      continue;
    }
    if (ans[a[i] - 1] > 0) {
      ans[a[i]]++;
      ans[a[i] - 1]--;
    }
  }
  cout << n - (ans[5] * 6);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  {
    solve();
    cout << endl;
  }
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}

### 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;
const long long int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int inf = 1e9 + 66555;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return ((a * b) / gcd(b, a));
}
long long int conv(long long int x) {
  if (x == 4) return 0;
  if (x == 8) return 1;
  if (x == 15) return 2;
  if (x == 16) return 3;
  if (x == 23) return 4;
  return 5;
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    a[i] = conv(x);
  }
  vector<long long int> ans(6);
  for (long long int i = 0; i < n; i++) {
    if (a[i] == 0) {
      ans[0]++;
      continue;
    }
    if (ans[a[i] - 1] > 0) {
      ans[a[i]]++;
      ans[a[i] - 1]--;
    }
  }
  cout << n - (ans[5] * 6);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  {
    solve();
    cout << endl;
  }
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}

```