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
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int put(vector<vector<int> > &p, int k) {
  int num = mp[k];
  if (num == 0) {
    p.resize(p.size() + 1);
    p[p.size() - 1].push_back(k);
    return 0;
  }
  int l = 0, r = p.size() - 1;
  while (l < r) {
    int mid = l + (r - l) / 2;
    if (p[mid].size() > num)
      l = mid + 1;
    else if (p[mid].size() <= num)
      r = mid;
  }
  if (p.size() == 0 || p[r].size() != num) return 1;
  p[r].push_back(k);
  return 0;
}
int main() {
  mp.insert({4, 0});
  mp.insert({8, 1});
  mp.insert({15, 2});
  mp.insert({16, 3});
  mp.insert({23, 4});
  mp.insert({42, 5});
  int n;
  cin >> n;
  vector<vector<int> > p;
  int k = 0;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    k += put(p, x);
  }
  int cnt = 0;
  for (int i = 0; i < p.size(); ++i) {
    if (p[i].size() < 6) cnt += p[i].size();
  }
  cnt += k;
  cout << cnt;
  return 0;
}
