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;
set<int> x[6];
int main() {
  int n, t;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> t;
    if (t == 4) x[0].insert(i);
    if (t == 8) x[1].insert(i);
    if (t == 15) x[2].insert(i);
    if (t == 16) x[3].insert(i);
    if (t == 23) x[4].insert(i);
    if (t == 42) x[5].insert(i);
  }
  int ans = 0;
  for (auto v : x[0]) {
    auto it1 = x[1].lower_bound(v);
    if (it1 != x[1].end()) {
      auto it2 = x[2].lower_bound(*it1);
      if (it2 != x[2].end()) {
        auto it3 = x[3].lower_bound(*it2);
        if (it3 != x[3].end()) {
          auto it4 = x[4].lower_bound(*it3);
          if (it4 != x[4].end()) {
            auto it5 = x[5].lower_bound(*it4);
            if (it5 != x[5].end()) {
              ans++;
              x[1].erase(it1);
              x[2].erase(it2);
              x[3].erase(it3);
              x[4].erase(it4);
              x[5].erase(it5);
            }
          }
        }
      }
    }
  }
  cout << n - ans * 6 << endl;
}
