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() {
  queue<long long> indx_4, indx_8, indx_15, indx_16, indx_23, indx_42;
  long long x, n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    if (x == 4) indx_4.push(i);
    if (x == 8) indx_8.push(i);
    if (x == 15) indx_15.push(i);
    if (x == 16) indx_16.push(i);
    if (x == 23) indx_23.push(i);
    if (x == 42) indx_42.push(i);
  }
  long long cnt = 0;
  while (true) {
    long long max;
    if (indx_4.empty()) break;
    max = indx_4.front();
    indx_4.pop();
    if (indx_8.empty()) break;
    while (indx_8.front() < max) {
      indx_8.pop();
      if (indx_8.empty()) {
        max = -5;
        break;
      }
    }
    if (max == -5)
      break;
    else {
      max = indx_8.front();
      indx_8.pop();
    }
    if (indx_15.empty()) break;
    while (indx_15.front() < max) {
      indx_15.pop();
      if (indx_15.empty()) {
        max = -5;
        break;
      }
    }
    if (max == -5)
      break;
    else {
      max = indx_15.front();
      indx_15.pop();
    }
    if (indx_16.empty()) break;
    while (indx_16.front() < max) {
      indx_16.pop();
      if (indx_16.empty()) {
        max = -5;
        break;
      }
    }
    if (max == -5)
      break;
    else {
      max = indx_16.front();
      indx_16.pop();
    }
    if (indx_23.empty()) break;
    while (indx_23.front() < max) {
      indx_23.pop();
      if (indx_23.empty()) {
        max = -5;
        break;
      }
    }
    if (max == -5)
      break;
    else {
      max = indx_23.front();
      indx_23.pop();
    }
    if (indx_42.empty()) break;
    while (indx_42.front() < max) {
      indx_42.pop();
      if (indx_42.empty()) {
        max = -5;
        break;
      }
    }
    if (max == -5)
      break;
    else {
      max = indx_42.front();
      indx_42.pop();
    }
    cnt++;
  }
  cout << (n - (6 * cnt));
  return 0;
}
