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

public class lose_it{
	public static void main(String args[]){
		
		Scanner in= new Scanner(System.in);
		int n = in.nextInt();
		int i,j,k,count=0;
		int com=0;
		int hash[] = new int[6];
		for(j=0;j<n;j++)
		{
			int x=in.nextInt();
			if(x==4)
			{
				hash[0]++;
			}
			if(x==8)
			{
				if(hash[0]>0 && hash[1]<hash[0])
				{
					hash[1]++;
				}
				else count++;
			}
			if(x==15)
			{
			
					if(hash[1]>0 && hash[2]<hash[1])
					{
						hash[2]++;
					}
					else count++;	
			}
			if(x==16)
			{
					if(hash[2]>0 && hash[3]<hash[2])
					{
						hash[3]++;
					}
					else count++;
			}
			if(x==23)
			{
					if(hash[3]>0 && hash[4]<hash[3])
					{
						hash[4]++;
					}
					else count++;
			}
			if(x==42)
			{
					if(hash[4]>0 && hash[5]<hash[4])
					{
						hash[5]++;
						com++;
					}
				
					else count++;
			}
		}
		for(i=0;i<6;i++) count=count+(hash[i]-com);
		
		System.out.println(count);
		
	}
}