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;
long long int convert(long long int x) {
  if (x == 4)
    return 1;
  else if (x == 8)
    return 2;
  else if (x == 15)
    return 3;
  else if (x == 16)
    return 4;
  else if (x == 23)
    return 5;
  else if (x == 42)
    return 6;
}
int main() {
  long long int i, j, n, k;
  cin >> n;
  long long int arr[n], p[7];
  long long int address[n + 1][7], count[7] = {0};
  for (i = 0; i <= n; i++)
    for (j = 0; j < 8; j++) address[i][j] = -1;
  for (i = 0; i < n; i++) {
    cin >> arr[i];
    count[convert(arr[i])]++;
    long long int k = convert(arr[i]);
    address[count[k]][k] = i;
  }
  long long int countx = 0;
  for (i = 0; i < 7; i++) p[i] = 1;
  for (i = 1; i <= count[1]; i++) {
    long long int prev = address[i][1];
    long long int counti = 1;
    for (j = 2; j < 7; j++) {
      long long int flag = 0;
      for (k = p[j]; k <= count[j]; k++) {
        if (address[k][j] > prev) {
          counti++;
          p[j] = k + 1;
          prev = address[k][j];
          flag = 1;
          break;
        }
      }
      if (flag == 0) p[j] = count[j] + 1;
    }
    if (counti == 6) countx++;
  }
  cout << n - 6 * countx;
  return 0;
}
