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

public class Rextester{
    public static void main(String[] args)throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = new Integer(br.readLine());
        StringTokenizer st = new StringTokenizer(br.readLine());
        br.close();
        int[] array = new int[n];
        int[] four = new int[n];//4
        int[] eig = new int[n];//8
        int[] fif = new int[n];//15
        int[] xten= new int[n];//16
        int[] tth = new int[n];//23
        int[] ftw = new int[n];//42
        Arrays.fill(four,-1);
        Arrays.fill(eig,-1);
        Arrays.fill(fif,-1);
        Arrays.fill(xten,-1);
        Arrays.fill(tth,-1);
        Arrays.fill(ftw,-1);
        int p=0,q=0,r=0,s=0,t=0,u=0;
        for(int i=0;i<n;i++){
            array[i]=new Integer(st.nextToken());
            if(array[i]==4){
                four[p++]=i;
            }
            else if(array[i]==8){
                if(four[q]!=-1){
                    eig[q++]=i;
                }
            }
            else if(array[i]==15){
                if(eig[r]!=-1){
                    fif[r++]=i;
                }
            }
            else if(array[i]==16){
                if(fif[s]!=-1){
                    xten[s++]=i;
                }
            }
            else if(array[i]==23){
                if(xten[t]!=-1){
                    tth[t++]=i;
                }
            }
            else if(array[i]==42){
                if(tth[u]!=-1){
                    ftw[u++]=i;
                }
            }
        }
        System.out.println(n-(6*u));
    }
}
        