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 n, excluidos = 0;
vector<priority_queue<int, vector<int>, greater<int>>> Vpq;
bool umVazio() {
  for (auto u : Vpq) {
    if (u.size() == 0) return true;
  }
  return false;
}
int procura(int indAnterior, int i) {
  int num = -1;
  while (Vpq[i].size() != 0) {
    if (Vpq[i].top() > indAnterior) {
      num = Vpq[i].top();
      Vpq[i].pop();
      return num;
    } else {
      excluidos++;
      Vpq[i].pop();
    }
  }
  return num;
}
int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(0);
  cin >> n;
  int a;
  Vpq.resize(6);
  for (int i = 0; i < n; i++) {
    cin >> a;
    if (a == 4) {
      Vpq[0].push(i);
    } else if (a == 8) {
      Vpq[1].push(i);
    } else if (a == 15) {
      Vpq[2].push(i);
    } else if (a == 16) {
      Vpq[3].push(i);
    } else if (a == 23) {
      Vpq[4].push(i);
    } else if (a == 42) {
      Vpq[5].push(i);
    }
  }
  bool flag = 1;
  while (flag) {
    int indAnterior = -2;
    for (int i = 0; i < 6; i++) {
      indAnterior = procura(indAnterior, i);
      if (indAnterior == -1) {
        excluidos += i;
        flag = 0;
        break;
      }
    }
  }
  for (int i = 0; i < 6; i++) {
    excluidos += Vpq[i].size();
  }
  cout << excluidos << endl;
  return 0;
}
