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;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
const long long MOD = 1e9 + 7;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
int n;
const int MX = 5 * 100000 + 7;
int p[6][MX];
int num[6];
int now[6];
bool check(int i, int j) {
  while (now[j] <= num[j] - 1) {
    if (p[i][now[i]] >= p[j][now[j]]) {
      now[j] += 1;
    } else {
      return true;
    }
  }
  return false;
}
int main() {
  cin >> n;
  int allnum = 0;
  for (int i = (1); i <= (n); i++) {
    int a;
    scanf("%d", &a);
    if (a == 4) {
      p[0][num[0]] = i;
      num[0] += 1;
    } else if (a == 8) {
      p[1][num[1]] = i;
      num[1] += 1;
    } else if (a == 15) {
      p[2][num[2]] = i;
      num[2] += 1;
    } else if (a == 16) {
      p[3][num[3]] = i;
      num[3] += 1;
    } else if (a == 23) {
      p[4][num[4]] = i;
      num[4] += 1;
    } else if (a == 42) {
      p[5][num[5]] = i;
      num[5] += 1;
    }
    allnum += 1;
  }
  int cnt = 0;
  while (true) {
    for (int j = (0); j <= (4); j++) {
      if (check(j, j + 1) == false) {
        cout << allnum - 6 * cnt << endl;
        return 0;
      }
    }
    cnt += 1;
    for (int j = (0); j <= (5); j++) {
      now[j] += 1;
    }
  }
  return 0;
}
