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;
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i, j, k, x, cnt = 0, y;
  vector<int> a;
  vector<int> b;
  vector<int> c;
  vector<int> d;
  vector<int> e;
  vector<int> f;
  vector<int> v;
  map<int, int> p;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> x;
    if (x == 4)
      a.push_back(i);
    else if (x == 8)
      b.push_back(i);
    else if (x == 15)
      c.push_back(i);
    else if (x == 16)
      d.push_back(i);
    else if (x == 23)
      e.push_back(i);
    else
      f.push_back(i);
  }
  v.push_back(a.size());
  v.push_back(b.size());
  v.push_back(c.size());
  v.push_back(d.size());
  v.push_back(e.size());
  v.push_back(f.size());
  sort(v.begin(), v.end());
  k = v[0];
  i = 0;
  while (k--) {
    j = upper_bound(b.begin(), b.end(), a[i]) - b.begin();
    if (j >= b.size() || b.size() == 0) break;
    y = j;
    j = upper_bound(c.begin(), c.end(), b[j]) - c.begin();
    b.erase(b.begin(), b.begin() + y + 1);
    if (j >= c.size() || c.size() == 0) break;
    y = j;
    j = upper_bound(d.begin(), d.end(), c[j]) - d.begin();
    c.erase(c.begin(), c.begin() + y + 1);
    if (j >= d.size() || d.size() == 0) break;
    y = j;
    j = upper_bound(e.begin(), e.end(), d[j]) - e.begin();
    d.erase(d.begin(), d.begin() + y + 1);
    if (j >= e.size() || e.size() == 0) break;
    y = j;
    j = upper_bound(f.begin(), f.end(), e[j]) - f.begin();
    e.erase(e.begin(), e.begin() + y + 1);
    if (j >= f.size() || f.size() == 0) break;
    f.erase(f.begin(), f.begin() + j + 1);
    i++;
    cnt++;
  }
  cout << n - cnt * 6;
}
