L. Lose it!

L. Lose it!

You are given an array a consisting of n integers. Each ai 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 k6 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⋅105) — the number of elements in a.

The second line of the input contains n integers a1,a2,…,an (each ai is one of the following numbers: 4,8,15,16,23,42), where ai 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/甩头dc++.h>
using namespace std;
typedef long long ll;
int a[500010];
int b[10];
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	if(n<6)cout<<n<<'\n';
	else 
	{
		memset(b,0,sizeof(b));
		for(int i=1;i<=n;i++)
		{
			if(a[i]==4)b[1]++; 
			else if(a[i]==8)
			{
				if(b[1]>b[2])b[2]++;
			}
			else if(a[i]==15)
			{
				if(b[1]>=b[2]&&b[2]>b[3])b[3]++;
			}
			else if(a[i]==16)
			{
				if(b[1]>=b[2]&&b[2]>=b[3]&&b[3]>b[4])b[4]++;
			}
			else if(a[i]==23)
			{
				if(b[1]>=b[2]&&b[2]>=b[3]&&b[3]>=b[4]&&b[4]>b[5])b[5]++;
			}
			else if(a[i]==42)
			{
				if(b[1]>=b[2]&&b[2]>=b[3]&&b[3]>=b[4]&&b[4]>=b[5]&&b[5]>b[6])b[6]++;
			}
		}
		cout<<n-b[6]*6<<'\n';
	} 
	return 0;
 }