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;
string s1, s2, s3;
string s;
long long int a[500001];
int main() {
  long long int v, b[6] = {4, 8, 15, 16, 23, 42}, c = 0, e, f, g, h, i, j,
                   k = 0, l = 0, m, n, p = 0, q, t, ct = 0, ct1 = 0, ct2 = 0,
                   ck = 0, ck1 = 0, ck2 = 0, ln, ln1, start, end, mid;
  long long int a1 = 0, cnt = 0, a2 = 0, a3 = 0, a4 = 0, a5 = 0, a6 = 0,
                sum = 0, sum1 = 0, max1, max2, min1, min2;
  double x, y, z;
  unsigned long long int d = 1;
  string jo, lo, ko;
  char st[1001], ch, ch1, ch2;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (i = 0; i < n; i++) {
    if (a[i] == 4)
      a1++;
    else if (a[i] == 8)
      a2++;
    else if (a[i] == 15)
      a3++;
    else if (a[i] == 16)
      a4++;
    else if (a[i] == 23)
      a5++;
    else
      a6++;
    if (a2 > a1)
      a2--;
    else if (a3 > a2)
      a3--;
    else if (a4 > a3)
      a4--;
    else if (a5 > a4)
      a5--;
    else if (a6 > a5)
      a6--;
  }
  c = min(a1, (min(a2, min(a3, min(a4, min(a5, a6))))));
  cout << n - c * 6;
  return 0;
}
