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;
vector<bool> is_prime(1000000 + 1, true);
vector<int> primes;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  int n;
  while (t--) {
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++) cin >> v[i];
    vector<vector<int> > dp(n + 1, vector<int>(6));
    for (int i = 1; i <= n; i++) {
      if (v[i - 1] == 4)
        dp[i][0]++;
      else if (v[i - 1] == 8 && dp[i - 1][0] > 0) {
        dp[i][1]++;
        dp[i - 1][0]--;
      } else if (v[i - 1] == 15 && dp[i - 1][1] > 0) {
        dp[i][2]++;
        dp[i - 1][1]--;
      } else if (v[i - 1] == 16 && dp[i - 1][2] > 0) {
        dp[i][3]++;
        dp[i - 1][2]--;
      } else if (v[i - 1] == 23 && dp[i - 1][3] > 0) {
        dp[i][4]++;
        dp[i - 1][3]--;
      } else if (v[i - 1] == 42 && dp[i - 1][4] > 0) {
        dp[i][5]++;
        dp[i - 1][4]--;
      }
      for (int j = 0; j < 6; j++) {
        dp[i][j] += dp[i - 1][j];
      }
    }
    cout << n - 6 * dp[n][5] << "\n";
  }
}
