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;
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
inline int readInt() {
  int x;
  scanf("%d", &x);
  return x;
}
struct Edge {
  int to, cost;
  Edge(int to, int cost) : to(to), cost(cost) {}
};
vector<vector<Edge>> graph;
const int INF = 100000000;
int a, b, c, d, e, f;
bool used[500010];
int main() {
  int n;
  cin >> n;
  vector<int> v(n);
  int cnt = 0;
  for (int i = 0; i < (int)n; ++i) {
    cin >> v[i];
    if (v[i] == 4) a++;
    if (v[i] == 8) b++;
    if (v[i] == 15) c++;
    if (v[i] == 16) d++;
    if (v[i] == 23) e++;
    if (v[i] == 42) f++;
    if (a < b) {
      cnt++;
      b--;
    } else if (a < c) {
      cnt++;
      c--;
    } else if (a < d) {
      cnt++;
      d--;
    } else if (a < e) {
      cnt++;
      e--;
    } else if (a < f) {
      cnt++;
      f--;
    } else if (b < c) {
      cnt++;
      c--;
    } else if (b < d) {
      cnt++;
      d--;
    } else if (b < e) {
      cnt++;
      e--;
    } else if (b < f) {
      cnt++;
      f--;
    } else if (c < d) {
      cnt++;
      d--;
    } else if (c < e) {
      cnt++;
      e--;
    } else if (c < f) {
      cnt++;
      f--;
    } else if (d < e) {
      cnt++;
      e--;
    } else if (d < f) {
      cnt++;
      f--;
    } else if (e < f) {
      cnt++;
      f--;
    }
  }
  cnt = cnt + abs(b - f) + abs(c - f) + abs(d - f) + abs(e - f) + abs(f - a);
  cout << cnt << endl;
  return 0;
}
