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>
const long long mod = 1e9 + 7;
using namespace std;
int main() {
  long long n;
  cin >> n;
  long long arr[n];
  for (long long i = 0; i < n; i++) cin >> arr[i];
  long long d1[n], d2[n], d3[n], d4[n], d5[n], d6[n];
  memset(d1, 0, sizeof(d1));
  memset(d2, 0, sizeof(d2));
  memset(d3, 0, sizeof(d3));
  memset(d4, 0, sizeof(d4));
  memset(d5, 0, sizeof(d5));
  memset(d6, 0, sizeof(d6));
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      if (arr[i] == 4)
        d1[0] = 1;
      else
        d1[0] = 0;
    } else {
      d1[i] += d1[i - 1] + (arr[i] == 4);
    }
  }
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      d2[0] = 0;
    } else {
      d2[i] += min(d1[i], d2[i - 1] + (arr[i] == 8));
    }
  }
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      d3[0] = 0;
    } else {
      d3[i] += min(d2[i], d3[i - 1] + (arr[i] == 15));
    }
  }
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      d4[0] = 0;
    } else {
      d4[i] += min(d3[i], d4[i - 1] + (arr[i] == 16));
    }
  }
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      d5[0] = 0;
    } else {
      d5[i] += min(d4[i], d5[i - 1] + (arr[i] == 23));
    }
  }
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      d6[0] = 0;
    } else {
      d6[i] += min(d5[i], d6[i - 1] + (arr[i] == 42));
    }
  }
  cout << n - 6 * d6[n - 1] << endl;
}
