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.*;
public class div565{
	public static void main(String s[]){
		Scanner sc = new Scanner(System.in);
		ArrayList<Integer> al = new ArrayList<>();
		int n = sc.nextInt();
		for(int i=0;i<n;i++)
			al.add(sc.nextInt());
		
		int arr[]= new int[43];
		int val[] = {4,8,15,16,23,42};
		long count=0;
		for(int i=0;i<n;i++){
			
				int index=0;
				int temp=al.get(i);
				if(temp==4)
					index=0;
				else if(temp==8)
					index=1;
				else if(temp==15)
					index=2;
				else if(temp==16)
					index=3;
				else if(temp==23)
					index=4;
				else if(temp==42)
					index=5;
				boolean b=false;
				
				
				for(int j=index-1;j>=0;j--){
					if(arr[val[j]]>=1+arr[val[index]]){
						b=true;
					}else{
						b=false;
						break;
					}
				}
				if(index==0){
					arr[val[0]]+=1;
				}
				else if(b==true){
					arr[val[index]]+=1;
				}
				
			
		}
		
		long ans=Integer.MAX_VALUE;
		for(int i=0;i<6;i++){
				ans=Math.min(ans,arr[val[i]]);
			}
			System.out.println(n-(6*ans));
	}
}