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;
typedef struct {
  int x, y;
} node;
struct edge {
  int from, to, w;
  edge(int a, int b, int c) {
    from = a;
    to = b;
    w = c;
  }
};
struct s_node {
  int id, dis;
  s_node(int a, int b) {
    id = a;
    dis = b;
  }
  bool operator<(const s_node& a) const { return dis > a.dis; }
};
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long arr[500010];
int dp[7];
int main(int argc, const char* argv[]) {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  for (int i = 1; i <= n; i++) {
    if (arr[i] == 4)
      dp[1]++;
    else if (arr[i] == 8 && dp[1]) {
      dp[2]++;
      dp[1]--;
    } else if (arr[i] == 15 && dp[2]) {
      dp[3]++;
      dp[2]--;
    } else if (arr[i] == 16 && dp[3]) {
      dp[4]++;
      dp[3]--;
    } else if (arr[i] == 23 && dp[4]) {
      dp[5]++;
      dp[4]--;
    } else if (arr[i] == 42 && dp[5]) {
      dp[6]++;
      dp[5]--;
    }
  }
  cout << n - dp[6] * 6 << "\n";
  return 0;
}
