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.util.*;
import java.lang.*;
public class MyClass {
    public static void main(String args[]) {
        Scanner se= new Scanner(System.in);
        int n= se.nextInt();
        ArrayList<Integer> arr=new ArrayList<Integer>();
        for(int i=0; i<n;i++){
            arr.add(se.nextInt());
        }
        ArrayList<Integer>[] al = new ArrayList[n];
        for(int i=0;i<n;i++){
            al[i] = new ArrayList<Integer>();
        }
        int count=0;
        int p=0;int q=0;int r=0;int s=0;int t=0;int u=0;
        for(int j=0;j<n;j++){
            if(arr.get(j)==4){
                al[p].add(4);
                p++;
            }
            if(arr.get(j)==8 && p>q){
                al[q].add(8);
                q++;
            }
            if(arr.get(j)==15 && q>r){
                al[r].add(15);
                r++;
            }
            if(arr.get(j)==16 && r>s){
                al[s].add(16);
                s++;
            }
            if(arr.get(j)==23 && s>t){
                al[t].add(23);
                t++;
            }
            if(arr.get(j)==42 && t>u){
                al[u].add(42);
                u++;
            }
        }
        for(int k=0;k<p;k++){
            if(al[k].size()==6)
                count=count+6;
        }
        System.out.println(n-count);
    }
}
