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>
const int N = 2e5 + 1;
using namespace std;
long long int ceil(long long int a, long long int b) {
  long long int res = (a + b - 1) / b;
  return res;
}
long long int str_to_num(string s) { return stoi(s); }
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
string num_to_str(long long int num) { return to_string(num); }
bool isPrime(int x) {
  if (x < 2) return false;
  for (int y = 2; y * y <= x; y++)
    if (x % y == 0) return false;
  return true;
}
double rnd(double var) {
  double value = (int)(var * 100 + .5);
  return (double)value / 100;
}
bool check(string s) {
  string t = s;
  reverse(s.begin(), s.end());
  return t == s;
}
long long int fact[N + 1];
void factorial() {
  fact[0] = 1;
  for (int i = 1; i <= N; i++) {
    fact[i] = (fact[i - 1] * i) % 1000000007;
  }
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> v(n);
  for (long long int i = 0; i < n; i++) cin >> v[i];
  vector<long long int> t(43);
  t[4] = 0, t[8] = 1, t[15] = 2, t[16] = 3, t[23] = 4, t[42] = 5;
  vector<long long int> dp(6, 0);
  long long int ans = 0;
  for (long long int i = 0; i < n; i++) {
    long long int x = v[i];
    long long int ind = t[x];
    long long int mini = -1;
    if (ind != 0) mini = *min_element(dp.begin(), dp.begin() + ind);
    if (mini != -1 and mini <= dp[ind])
      ans++;
    else
      dp[ind]++;
  }
  for (long long int i = 5; i >= 1; i--) {
    if (dp[i] != dp[i - 1]) {
      ans += abs(dp[i] - dp[i - 1]), dp[i - 1] = dp[i];
    }
  }
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
