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;
bool comp(long long a, long long b) { return (a < b); }
void solve();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs"
       << "\n";
  return 0;
}
void solve() {
  long long n;
  cin >> n;
  map<int, long long> mp;
  int arr[6] = {4, 8, 15, 16, 23, 42};
  vector<long long> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  int x = 0;
  for (int i = 0; i < n; i++) {
    x = v[i];
    if (x == 4) {
      mp[x]++;
    } else if (x == 8) {
      if (mp[4] > mp[8]) {
        mp[x]++;
      }
    } else if (x == 15) {
      if (mp[8] > mp[15]) {
        mp[x]++;
      }
    } else if (x == 16) {
      if (mp[15] > mp[16]) {
        mp[x]++;
      }
    } else if (x == 23) {
      if (mp[16] > mp[23]) {
        mp[x]++;
      }
    } else if (x == 42) {
      if (mp[23] > mp[42]) {
        mp[x]++;
      }
    }
  }
  long long mini = INT_MAX;
  for (int i = 0; i < 6; i++) {
    mini = min(mini, mp[arr[i]]);
  }
  long long ans = mini * 6;
  cout << n - ans;
}
