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 int N = 5e5 + 10;
int a[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  while (cin >> n) {
    for (int i = 1; i <= n; i++) cin >> a[i];
    deque<int> v[7];
    for (int i = 1; i <= n; i++)
      if (a[i] == 4)
        v[1].push_back(i);
      else if (a[i] == 8)
        v[2].push_back(i);
      else if (a[i] == 15)
        v[3].push_back(i);
      else if (a[i] == 16)
        v[4].push_back(i);
      else if (a[i] == 23)
        v[5].push_back(i);
      else
        v[6].push_back(i);
    int cnt = 0;
    bool flag = 1;
    while (!v[1].empty() && flag) {
      int la = v[1].front();
      v[1].pop_front();
      for (int i = 2; i <= 6 && flag; i++) {
        if (v[i].empty()) {
          flag = 0;
          break;
        }
        if (v[i].front() > la) {
          la = v[i].front();
          v[i].pop_front();
        } else {
          while (!v[i].empty() && v[i].front() < la) v[i].pop_front();
          if (v[i].empty()) {
            flag = 0;
            break;
          } else {
            la = v[i].front();
            v[i].pop_front();
          }
        }
      }
      if (flag) cnt++;
    }
    cout << n - 6 * cnt << endl;
  }
  return 0;
}
