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 main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, x, c = 0, b[6] = {4, 8, 15, 16, 23, 42};
  cin >> n;
  queue<long long> q[6];
  for (long long i = 0; i < n; i++) {
    cin >> x;
    switch (x) {
      case 4:
        q[0].emplace(i);
        break;
      case 8:
        q[1].emplace(i);
        break;
      case 15:
        q[2].emplace(i);
        break;
      case 16:
        q[3].emplace(i);
        break;
      case 23:
        q[4].emplace(i);
        break;
      case 42:
        q[5].emplace(i);
        break;
    }
  }
  while (1) {
    long long y, z, f = 1;
    for (long long i = 0; i < 6; i++) {
      if (!q[i].empty()) {
        if (i == 0) {
          y = q[i].front();
          q[i].pop();
        } else {
          z = q[i].front();
          q[i].pop();
          while (!q[i].empty() && y > z) {
            z = q[i].front();
            q[i].pop();
          }
          if (y < z) {
            y = z;
          } else {
            f = 0;
            break;
          }
        }
      } else {
        f = 0;
        break;
      }
    }
    if (f == 1) {
      c += 6;
    } else {
      break;
    }
  }
  cout << n - c;
  return 0;
}
