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;
int32_t main() {
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  long long int count1 = 0, count2 = 0, count3 = 0, count4 = 0, count5 = 0,
                count6 = 0, count = 0;
  long long int dp[n][6];
  long long int sum = 0;
  for (long long int i = 0; i < n; ++i) {
    if (a[i] == 4)
      count1++;
    else {
      if (a[i] == 8) {
        if (count1 > count2)
          count2++;
        else
          count++;
      } else {
        if (a[i] == 15) {
          if (count2 > count3)
            count3++;
          else
            count++;
        } else {
          if (a[i] == 16) {
            if (count3 > count4)
              count4++;
            else
              count++;
          } else {
            if (a[i] == 23) {
              if (count4 > count5)
                count5++;
              else
                count++;
            } else {
              if (a[i] == 42) {
                if (count5 > count6)
                  count6++;
                else
                  count++;
              } else
                count++;
            }
          }
        }
      }
    }
  }
  sum += ((count1 - count6) + (count2 - count6) + (count3 - count6) +
          (count4 - count6) + (count5 - count6));
  sum += count;
  cout << sum << "\n";
}
