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;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  map<long long, long long> ump;
  vector<vector<long long>> a(n, vector<long long>(6, 0));
  for (long long i = 0; i < n; i++) {
    ump[v[i]]++;
    a[i][0] = ump[4];
    a[i][1] = ump[8];
    a[i][2] = ump[15];
    a[i][3] = ump[16];
    a[i][4] = ump[23];
    a[i][5] = ump[42];
  }
  long long ans = 0;
  long long a4 = 0, a8 = 0, a15 = 0, a16 = 0, a23 = 0, a42 = 0;
  for (long long i = 0; i < n; i++) {
    if (v[i] == 4) {
      a4++;
    }
    if (v[i] == 8) {
      if (!a4)
        ans++;
      else {
        a4--;
        a8++;
      }
    }
    if (v[i] == 15) {
      if (!a8)
        ans++;
      else {
        a8--;
        a15++;
      }
    }
    if (v[i] == 16) {
      if (!a15)
        ans++;
      else {
        a15--;
        a16++;
      }
    }
    if (v[i] == 23) {
      if (!a16)
        ans++;
      else {
        a16--;
        a23++;
      }
    }
    if (v[i] == 42) {
      if (!a23)
        ans++;
      else {
        a23--;
      }
    }
  }
  if (a4) {
    ans += a4;
  }
  if (a8) {
    ans += 2 * a8;
  }
  if (a15) {
    ans += 3 * a15;
  }
  if (a16) {
    ans += 4 * a16;
  }
  if (a23) {
    ans += 5 * a23;
  }
  cout << ans;
  return 0;
}
