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.io.*;
import java.util.*;
public class S {
	public static void main (String[] args) {
		Scanner in=new Scanner(System.in);
		int n=in.nextInt();
		ArrayList<Integer> al[]=new ArrayList[43];
		for(int i=0;i<43;i++)al[i]=new ArrayList<>();
		for(int i=0;i<n;i++)
		{
		    int x=in.nextInt();
		    al[x].add(i);
		}
		if(al[4].size()==0 || al[8].size()==0 || al[15].size()==0 || al[16].size()==0 || al[23].size()==0 || al[42].size()==0)
		    System.out.print(n);
		else
		{
		    int j4=0,j8=0,j15=0,j16=0,j23=0,j42=0,cnt=0;      
		    while(true)
		    {
		        int count=0,z=al[4].get(j4);
		        while(j4<al[4].size())
		        {
		            count++;
		            j4++;
		            break;
		        }
		        while(j8<al[8].size())
		        {
		            if(z<al[8].get(j8))
		            {
		                count++;
		                z=al[8].get(j8);
		                j8++;
		                break;
		            }
		            else j8++;
		        }
		        while(j15<al[15].size())
		        {
		            if(z<al[15].get(j15))
		            {
		                count++;
		                z=al[15].get(j15);
		                j15++;
		                break;
		            }
		            else j15++;
		        }
		        while(j16<al[16].size())
		        {
		            if(z<al[16].get(j16))
		            {
		                count++;
		                z=al[16].get(j16);
		                j16++;
		                break;
		            }
		            else j16++;
		        }
		        while(j23<al[23].size())
		        {
		            if(z<al[23].get(j23))
		            {
		                count++;
		                z=al[23].get(j23);
		                j23++;
		                break;
		            }
		            else j23++;
		        }
		        while(j42<al[42].size())
		        {
		            if(z<al[42].get(j42))
		            {
		                count++;
		                z=al[42].get(j42);
		                j42++;
		                break;
		            }
		            else j42++;
		        }
		        if(count==6)cnt++;
		        if(al[4].size()==j4 || al[8].size()==j8 || al[15].size()==j15 || al[16].size()==j16 || al[23].size()==j23 || al[42].size()==j42)break;
		    }
		    System.out.print(n-(6*cnt));
		}
	}
}