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;
int n, arr[15], x, ans;
int main() {
  scanf("%d", &n);
  if (n < 6)
    printf("%d\n", n);
  else {
    for (int i = 0; i < n; i++) {
      scanf("%d", &x);
      if (x == 4)
        arr[1]++;
      else if (x == 8) {
        if (arr[1] < arr[2] + 1)
          ans++;
        else
          arr[2]++;
      } else if (x == 15) {
        if (arr[2] < arr[3] + 1)
          ans++;
        else
          arr[3]++;
      } else if (x == 16) {
        if (arr[3] < arr[4] + 1)
          ans++;
        else
          arr[4]++;
      } else if (x == 23) {
        if (arr[4] < arr[5] + 1)
          ans++;
        else
          arr[5]++;
      } else if (x == 42) {
        if (arr[5] < arr[6] + 1)
          ans++;
        else
          arr[6]++;
      } else
        ans++;
    }
    for (int i = 1; i < 7; i++) {
      ans += arr[i] - arr[6];
    }
    printf("%d\n", ans);
  }
}
