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_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n;
  cin >> n;
  int arr[6] = {4, 8, 15, 16, 23, 42};
  vector<int> v[50];
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v[x].push_back(i);
  }
  int mn = INT_MAX;
  for (int i = 0; i < 6; i++) {
    mn = min(mn, (int)v[arr[i]].size());
    reverse(v[arr[i]].begin(), v[arr[i]].end());
  }
  int ans = 0, flag = 0;
  for (int i = 0; i < mn; i++) {
    int c = 1, st = v[arr[0]].back();
    v[arr[0]].pop_back();
    for (int j = 1; j < 6; j++) {
      while (v[arr[j]].size() > 0 && v[arr[j]].back() < st) {
        v[arr[j]].pop_back();
        ans++;
      }
      if (v[arr[j]].size() == 0) {
        flag = 1;
        break;
      }
      c++;
      st = v[arr[j]].back();
      v[arr[j]].pop_back();
    }
    if (c < 6) {
      ans += c;
      break;
    }
    if (flag) break;
  }
  for (int i = 0; i < 6; i++) {
    ans += v[arr[i]].size();
  }
  cout << ans;
}
