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
import java.util.*;
import java.io.*;

public class Lose_it
{
	public static void main(String[] args) throws IOException 
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw=new PrintWriter(System.out);

		int t=1;

		while(t-->0)
		{
			int n=Integer.parseInt(br.readLine());
			int a[]=new int[n];
			String str[]=br.readLine().trim().split(" ");
			for(int i=0;i<n;i++)
				a[i]=Integer.parseInt(str[i]);

			int ans=0;
			HashMap<Integer,Integer> mp=new HashMap<>();
			for(int i=0;i<n;i++)
			{
				if(a[i]==4)
					mp.put(4,mp.getOrDefault(4,0)+1);

				if(a[i]==8)
				{
					int x=mp.getOrDefault(4,0);
					if(x>0)
					{
						mp.put(8,mp.getOrDefault(8,0)+1);
						mp.put(4,mp.getOrDefault(4,0)-1);
					}
				}

				if(a[i]==15)
				{
					int x=mp.getOrDefault(8,0);
					if(x>0)
					{
						mp.put(15,mp.getOrDefault(15,0)+1);
						mp.put(8,mp.getOrDefault(8,0)-1);
					}
				}

				if(a[i]==16)
				{
					int x=mp.getOrDefault(15,0);
					if(x>0)
					{
						mp.put(16,mp.getOrDefault(16,0)+1);
						mp.put(15,mp.getOrDefault(15,0)-1);
					}
				}

				if(a[i]==23)
				{
					int x=mp.getOrDefault(16,0);
					if(x>0)
					{
						mp.put(23,mp.getOrDefault(23,0)+1);
						mp.put(16,mp.getOrDefault(16,0)-1);
					}
				}

				if(a[i]==42)
				{
					int x=mp.getOrDefault(23,0);
					if(x>0)
					{
						ans++;
						mp.put(23,mp.getOrDefault(23,0)-1);
					}
				}
			}

			pw.println(n-ans*6);
			
		}
		pw.flush();
	}
}