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.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import java.io.*;

public class S {
    public static void main(String[] args)throws IOException {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int a[]=new int[n];
        for(int i=0;i<n;i++) a[i]=sc.nextInt();
        HashMap<Integer,Integer> map=new HashMap<>();
        for(int i=0;i<n;i++){
            if(map.containsKey(a[i])) map.put(a[i],map.get(a[i])+1);
            else map.put(a[i],1);
        }
        //System.out.println(map);
        if(map.size()!=6) System.out.println(n);
        else{
            int min=Integer.MAX_VALUE;
            for(Map.Entry<Integer,Integer> en:map.entrySet()){
                min=Math.min(min,en.getValue());
            }
            HashMap<Integer,ArrayList<Integer>> m=new HashMap<>();
            ArrayList<Integer> al[]=new ArrayList[6];
            for(int i=0;i<6;i++) al[i]=new ArrayList<>();
            for(int i=0;i<n;i++){
                if(a[i]==4) al[0].add(i);
                else if(a[i]==8) al[1].add(i);
                else if(a[i]==15) al[2].add(i);
                else if(a[i]==16) al[3].add(i);
                else if(a[i]==23) al[4].add(i);
                else if(a[i]==42) al[5].add(i);
            }
            m.put(4,al[0]);m.put(8,al[1]);m.put(15,al[2]);m.put(16,al[3]);m.put(23,al[4]);m.put(42,al[5]);
            int res=0;
            int j1=0,j2=0,j3=0,j4=0,j5=0;
            for(int i=0;i<min;i++){
                int i1=m.get(4).get(i);
                int flag=0;
                for(;j1<m.get(8).size();j1++){
                    if(m.get(8).get(j1)>i1){
                        flag=1;
                        i1=m.get(8).get(j1);
                        //m.get(8).set(j1,-1);
                        j1++;
                        break;
                    }
                }
                if(flag==0) break;
                flag=0;
                for(;j2<m.get(15).size();j2++){
                    if(m.get(15).get(j2)>i1){
                        flag=1;
                        i1=m.get(15).get(j2);
                        //m.get(15).set(j2,-1);
                        j2++;
                        break;
                    }
                }
                if(flag==0) break;
                flag=0;
                for(;j3<m.get(16).size();j3++){
                    if(m.get(16).get(j3)>i1){
                        flag=1;
                        i1=m.get(16).get(j3);
                        //m.get(16).set(j3,-1);
                        j3++;
                        break;
                    }
                }
                if(flag==0) break;
                flag=0;
                for(;j4<m.get(23).size();j4++){
                    if(m.get(23).get(j4)>i1){
                        flag=1;
                        i1=m.get(23).get(j4);
                        //m.get(23).set(j4,-1);
                        j4++;
                        break;
                    }
                }
                if(flag==0) break;
                flag=0;
                for(;j5<m.get(42).size();j5++){
                    if(m.get(42).get(j5)>i1){
                        flag=1;
                        i1=m.get(42).get(j5);
                        //m.get(42).set(j5,-1);
                        j5++;
                        break;
                    }
                }
                if(flag==0) break;
                res+=6;
            }

            res=n-res;
            System.out.println(res);
        }
    }
}
