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;
template <class T>
void countSort(vector<T>& arr) {
  T max = *max_element(arr.begin(), arr.end());
  T min = *min_element(arr.begin(), arr.end());
  int range = max - min + 1;
  vector<int> count(range);
  std::vector<T> output(arr.size());
  for (int i = 0; i < arr.size(); i++) count[arr[i] - min]++;
  for (int i = 1; i < count.size(); i++) count[i] += count[i - 1];
  for (int i = arr.size() - 1; i >= 0; i--) {
    output[count[arr[i] - min] - 1] = arr[i];
    count[arr[i] - min]--;
  }
  for (int i = 0; i < arr.size(); i++) arr[i] = output[i];
}
template <class T>
bool search(vector<T> arr, T n) {
  std::vector<T> copy = arr;
  countSort<T>(copy);
  int low = 0, high = arr.size() - 1;
  while (low <= high) {
    int mid = (low + high) / 2;
    if (n < copy[mid]) {
      high = mid - 1;
    } else if (n > copy[mid]) {
      low = mid + 1;
    } else {
      return true;
    }
  }
  return false;
}
template <class T>
bool isPal(T n) {
  string s = n;
  int i = 0, j = s.length() - 1;
  while (i <= j) {
    if (s[i] != s[j]) return false;
    i++;
    j--;
  }
  return true;
}
bool isPrime(int n) {
  if (n <= 1 || n == 4) return false;
  if (n <= 3) return true;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
int num_of_factors(int n) {
  int c = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      c++;
      if (i != (n / i)) c++;
    }
  }
  return c;
}
int tc = 0;
const int dx4[4] = {1, -1, 0, 0}, dy4[4] = {0, 0, 1, -1};
void solve() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  if (n < 6) {
    cout << n;
    return;
  }
  int c1 = 0, c2 = 0, c3 = 0, c4 = 0, c5 = 0, c6 = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == 4)
      c1++;
    else if (a[i] == 8) {
      if (c1 > 0) c1--, c2++;
    } else if (a[i] == 15) {
      if (c2 > 0) c2--, c3++;
    } else if (a[i] == 16) {
      if (c3 > 0) c3--, c4++;
    } else if (a[i] == 23) {
      if (c4 > 0) c4--, c5++;
    } else if (a[i] == 42) {
      if (c5 > 0) c5--, c6++;
    }
  }
  cout << n - 6 * c6;
}
const long long int mxn = 1e9;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
