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>
long long mod = 1e9 + 7;
long long inf = 1e18 + 3;
using namespace std;
long long powerexp(long long x, long long y, long long m = 1e9 + 7) {
  if (y == 0) return 1;
  long long p = powerexp(x, y / 2, mod) % mod;
  p = (p * p) % mod;
  return (y % 2 == 0) ? p : (x * p) % mod;
}
long long modinverse(long long a, long long m = 1e9 + 7) {
  return powerexp(a, mod - 2, mod);
}
long long vector_upper_bound(vector<long long>& a, long long n, long long x) {
  long long l = 0;
  long long h = n;
  while (l < h) {
    long long mid = l + (h - l) / 2;
    if (x >= a[mid]) {
      l = mid + 1;
    } else {
      h = mid;
    }
  }
  return l;
}
long long vector_lower_bound(vector<long long>& a, long long n, long long x) {
  long long l = 0;
  long long h = n;
  while (l < h) {
    long long mid = l + (h - l) / 2;
    if (x <= a[mid]) {
      h = mid;
    } else {
      l = mid + 1;
    }
  }
  return l;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> a(n), cnt(6, 0);
    map<long long, long long> mapping;
    mapping[4] = 0;
    mapping[8] = 1;
    mapping[15] = 2;
    mapping[16] = 3;
    mapping[23] = 4;
    mapping[42] = 5;
    for (long long i = (0); i < (n); i += (1)) {
      cin >> a[i];
      if (a[i] == 4) {
        cnt[mapping[a[i]]]++;
      } else {
        if (cnt[mapping[a[i]] - 1]) {
          cnt[mapping[a[i]] - 1]--;
          cnt[mapping[a[i]]]++;
        }
      }
    }
    cout << (n - (6 * cnt[5])) << '\n';
  }
}
