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 mod = 1e9 + 7;
const long long inf = LLONG_MAX;
const long long N = 1e6;
signed main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  cin >> n;
  long long arr[n + 1];
  for (long long i = 1; i <= n; i++) cin >> arr[i];
  queue<long long> fr;
  queue<long long> egt;
  queue<long long> fif;
  queue<long long> six;
  queue<long long> twe;
  queue<long long> fort;
  for (long long i = 1; i <= n; i++) {
    if (arr[i] == 4)
      fr.push(i);
    else if (arr[i] == 8)
      egt.push(i);
    else if (arr[i] == 15)
      fif.push(i);
    else if (arr[i] == 16)
      six.push(i);
    else if (arr[i] == 23)
      twe.push(i);
    else if (arr[i] == 42)
      fort.push(i);
  }
  long long cnt = 0;
  while (1) {
    while (!fr.empty()) {
      long long flg = 0;
      long long a = fr.front();
      fr.pop();
      while (!egt.empty()) {
        long long b = egt.front();
        egt.pop();
        flg = 0;
        if (b > a) {
          while (!fif.empty()) {
            long long c = fif.front();
            fif.pop();
            flg = 0;
            if (c > b) {
              while (!six.empty()) {
                long long d = six.front();
                six.pop();
                flg = 0;
                if (d > c) {
                  while (!twe.empty()) {
                    long long e = twe.front();
                    twe.pop();
                    flg = 0;
                    if (e > d) {
                      while (!fort.empty()) {
                        long long f = fort.front();
                        fort.pop();
                        flg = 0;
                        if (f > e) {
                          flg = 1;
                          cnt++;
                          break;
                        }
                      }
                    }
                    if (flg == 1) break;
                  }
                }
                if (flg == 1) break;
              }
            }
            if (flg == 1) break;
          }
        }
        if (flg == 1) break;
      }
    }
    if (fr.empty()) break;
  }
  cout << n - 6 * cnt << '\n';
  return 0;
}
