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;
const long long INF = 1e18;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
template <typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
  for (auto i : v) os << i << " ";
  return os;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  long long n = v.size();
  for (long long i = (0); i < (long long)(n); i++) {
    long long a;
    cin >> a;
    v[i] = a;
  }
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, set<T>& second) {
  for (auto i : second) os << i << " ";
  return os;
}
long long mystoi(string str) {
  stringstream ss(str);
  long long ans = 0;
  ss >> ans;
  return ans;
}
long long exp(long long x, long long ex) {
  long long ans = 1ll;
  while (ex > 0) {
    if (ex & 1ll) ans = (ans * x);
    ex >>= 1ll;
    x = (x * x);
  }
  return ans;
}
bool sort_cond(const pair<long long, long long>& a,
               const pair<long long, long long>& b) {
  return a.first < b.first;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> arr(n);
    cin >> arr;
    vector<long long> val(6, 0);
    long long cnt = 0;
    for (long long i = (0); i < (long long)(n); i++) {
      if (arr[i] == 4)
        val[0]++;
      else if (arr[i] == 8) {
        if (val[1] < val[0])
          val[1]++;
        else
          cnt++;
      } else if (arr[i] == 15) {
        if (val[2] < val[1])
          val[2]++;
        else
          cnt++;
      } else if (arr[i] == 16) {
        if (val[3] < val[2])
          val[3]++;
        else
          cnt++;
      } else if (arr[i] == 23) {
        if (val[4] < val[3])
          val[4]++;
        else
          cnt++;
      } else if (arr[i] == 42) {
        if (val[5] < val[4])
          val[5]++;
        else
          cnt++;
      }
    }
    long long mi = *min_element(val.begin(), val.end());
    for (long long i = (0); i < (long long)(6); i++)
      if (val[i] > mi) cnt += val[i] - mi;
    cout << cnt << endl;
  }
}
