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
/*package whatever //do not write package name here */

import java.util.*;

public class GFG {
	public static void main (String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int i;
		int a[]=new int[n];
		int b[]=new int[43];
		for(i=0;i<43;i++){
		    b[i]=0;
		}
		for(i=0;i<n;i++){
		    a[i]=sc.nextInt();
		}
		for(i=0;i<n;i++){
		    if(a[i]==4){
		        b[4]+=1;
		    }
		       else if(a[i]==8){
		           if(b[4]-b[a[i]]>=1){
		               b[8]+=1;
		           }
		       }
		       else if(a[i]==15){
		           if(b[8]-b[a[i]]>=1){
		               b[15]+=1;
		           }
		       }
		       else if(a[i]==16){
		           if(b[15]-b[a[i]]>=1){
		               b[16]+=1;
		           }
		       }
		       else if(a[i]==23){
		           if(b[16]-b[a[i]]>=1){
		               b[23]+=1;
		           }
		       }
		       else if(a[i]==42){
		           if(b[23]-b[a[i]]>=1){
		               b[42]+=1;
		           }
		       }
		    }
		    int min=Integer.MAX_VALUE;
		    int c=0;
		    for(i=0;i<b.length;i++){
		        if(b[i]>0){
		            min=Math.min(min,b[i]);
		        }
		        if(b[4]==0 || b[8]==0 ||b[15]==0 || b[16]==0 || b[23]==0 || b[42]==0){
		            c+=1;
		        }
		    }
		    if(n<6 || c>0){
		        System.out.println(n);
		    }
		    else
		        System.out.println(n-(min*6));
		}
}