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
//I AM THE CREED
/* //I AM THE CREED
/* package codechef; // don't place package name! */
import java.io.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.StringTokenizer; 
import java.util.*;
import java.awt.Point;
public class Main{
    public static void main(String[] args) throws IOException 
    { 
  
        Scanner input = new Scanner(System.in);
        while(input.hasNext()){
            int n=input.nextInt();
            int[] l=new int[n];
            for(int i=0;i<n;i++){
                l[i]=input.nextInt();
            }
            int start=0;
            int end=n/6;
            while(start<end){
                int mid=start+((end-start)/2);
                if(possible((n%6)+(mid*6), l)){
                    end=mid;
                    continue;
                }
                start=mid+1;
            }
            System.out.println((start*6)+(n%6));
            
        }
        
    }
    public static boolean possible(int ct, int[] l){
        int del=0;
        HashMap<Integer, Integer> m=new HashMap<>();
        for(int i=0;i<l.length;i++){
            if(l[i]==4){
                m.put(4, m.getOrDefault(4, 0)+1);
                continue;
            }
            if(l[i]==8){
                if(m.getOrDefault(4, 0)>m.getOrDefault(8, 0)){
                    m.put(8, m.getOrDefault(8, 0)+1);
                    continue;
                }
                del++;
            }
            if(l[i]==15){
                if(m.getOrDefault(8, 0)>m.getOrDefault(15, 0)){
                    m.put(15, m.getOrDefault(15, 0)+1);
                    continue;
                }
                del++;
            }
            if(l[i]==16){
                if(m.getOrDefault(15, 0)>m.getOrDefault(16, 0)){
                    m.put(16, m.getOrDefault(16, 0)+1);
                    continue;
                }
                del++;
            }
            if(l[i]==23){
                if(m.getOrDefault(16, 0)>m.getOrDefault(23, 0)){
                    m.put(23, m.getOrDefault(23, 0)+1);
                    continue;
                }
                del++;    
            }
            if(l[i]==42){
                if(m.getOrDefault(23, 0)>m.getOrDefault(42, 0)){
                    m.put(42, m.getOrDefault(42, 0)+1);
                    continue;
                }
                del++;
            }
        }
        int min=Integer.MAX_VALUE;
        for(int i:m.keySet()){
            min=Math.min(min, m.get(i));
        }
        for(int i:m.keySet()){
            del+=m.get(i)-min;
        }
        return ct-del>=0 && (ct-del)%6==0;
    }
    


}