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

public class Main
{ 
    static BufferedReader br;
    static StringTokenizer st;
    static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    
    public static class AL<T> extends ArrayList<T> {};
    public static class HM<T,Integer> extends HashMap<T,T> {};
    public static class HS<T> extends HashSet<T> {};
    public static class TM<T,Integer> extends TreeMap<T,T> {};
    
    public static void main(String[] args) throws IOException 
	{
		br = new BufferedReader(new InputStreamReader(System.in));
		st = new StringTokenizer(br.readLine());

	      int n = nxtInt(), a[] = new int[n];
            HM<Integer,Integer> frq = new HM<>(), idx = new HM<>();
	      int[] tmp = {4,8,15,16,23,42};
	      for(int i=0; i<tmp.length; i++)
	      {
	            frq.put(tmp[i],0);
	            idx.put(tmp[i],i);
	      }
            
            int cnt = 0;
            st = new StringTokenizer(br.readLine());
            for(int i=0; i<n; i++)
            {
                a[i] = nxtInt();
                if(a[i] == 4 || frq.get(tmp[idx.get(a[i])-1]) > frq.get(a[i]))
                    frq.put(a[i], frq.get(a[i])+1);
                else cnt++;
            }
            
            int min = frq.get(4);
            for (Map.Entry<Integer, Integer> en : frq.entrySet()) 
                min = Math.min(en.getValue(),min);
            
            for (Map.Entry<Integer, Integer> en : frq.entrySet()) 
                cnt += en.getValue() - min;
            
		pr.println(cnt);
		pr.flush();
		pr.close();
    }
    
    static int nxtInt(){
        return Integer.parseInt(nxt());
    }
    
    static long nxtLong(){
        return Long.parseLong(nxt());
    }
    
    static double nxtDoub(){
        return Double.parseDouble(nxt());
    }
    
    static String nxt(){
        return st.nextToken();
    }
    
    static String nxtLn() throws IOException{
        return br.readLine();
    }
}