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 MX = 1e6 + 5;
const int INF = 1e9;
const int M = 1000000007;
vector<int> adj[100005];
vector<int> vis(100005, 0);
void solve() { return; }
int main() {
  ios_base::sync_with_stdio(false);
  int t = 1;
  while (t--) {
    int n;
    cin >> n;
    int ar[n];
    for (int i = 0; i < n; i++) {
      cin >> ar[i];
    }
    int br[] = {4, 8, 15, 16, 23, 42};
    map<int, int> pos;
    for (int i = 1; i <= 6; i++) {
      pos[br[i - 1]] = i;
    }
    map<int, int> ct;
    int count = 0;
    for (int i = 0; i < n; i++) {
      if (pos[ar[i]] == 0) {
        continue;
      }
      int p = pos[ar[i]];
      bool flag = 0;
      for (int j = 0; j < p - 1; j++) {
        if (ct[br[j]] == 0) {
          flag = 1;
          break;
        }
      }
      if (flag == 0) {
        if (p == 6) {
          count++;
          for (int j = 0; j < 5; j++) {
            ct[br[j]]--;
          }
        } else {
          if (p == 1) {
            ct[br[p - 1]]++;
            continue;
          }
          if (ct[br[p - 2]] > ct[br[p - 1]]) {
            ct[br[p - 1]]++;
          }
        }
      }
    }
    cout << n - 6 * count;
  }
  return 0;
}
