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;
queue<int> q1, q2, q3, q4, q5, q6;
int main() {
  int n, x, ans = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    if (x == 4)
      q1.push(i);
    else if (x == 8)
      q2.push(i);
    else if (x == 15)
      q3.push(i);
    else if (x == 16)
      q4.push(i);
    else if (x == 23)
      q5.push(i);
    else
      q6.push(i);
  }
  if (q1.empty() || q2.empty() || q3.empty() || q4.empty() || q5.empty() ||
      q6.empty()) {
    printf("%d\n", n - ans);
    return 0;
  }
  while (1) {
    if (q2.front() > q1.front()) {
      if (q3.front() > q2.front()) {
        if (q4.front() > q3.front()) {
          if (q5.front() > q4.front()) {
            if (q6.front() > q5.front()) {
              ans += 6;
              q1.pop();
              q2.pop();
              q3.pop();
              q4.pop();
              q5.pop();
              q6.pop();
            } else
              q6.pop();
          } else
            q5.pop();
        } else
          q4.pop();
      } else
        q3.pop();
    } else
      q2.pop();
    if (q1.empty() || q2.empty() || q3.empty() || q4.empty() || q5.empty() ||
        q6.empty())
      break;
  }
  printf("%d\n", n - ans);
  return 0;
}
