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 cf
{
public static void main(String[] args)
{
    Scanner in=new Scanner(System.in);
    int n=in.nextInt();
    int[] a=new int[n];
    for(int i=0;i<n;i++)
        a[i]=in.nextInt();
    int fc=0,ec=0,fic=0,sc=0,tc=0,foc=0;
    for(int i=0;i<n;i++)
        if(a[i]==4)
        {
            fc++;
            if(ec>=fc)
              ec=fc-1;
            if(fic>=fc)
              fic=fc-1;
            if(sc>=fc)
              sc=fc-1;
            if(tc>=fc)
              tc=fc-1;
            if(foc>=fc)
              foc=fc-1; 
        }
        else if(a[i]==8)
        {
            ec++;
            if(fic>=ec)
              fic=ec-1;
            if(sc>=ec)
              sc=ec-1;
            if(tc>=ec)
              tc=ec-1;
            if(foc>=ec)
              foc=ec-1; 
        }
        else if(a[i]==15)
        {
            fic++;
            if(sc>=fic)
              sc=fic-1;
            if(tc>=fic)
              tc=fic-1;
            if(foc>=fic)
              foc=fic-1; 
        }
        else if(a[i]==16)
        {
            sc++;
            if(tc>=sc)
              tc=sc-1;
            if(foc>=sc)
              foc=sc-1; 
        }
        else if(a[i]==23)
        {
            tc++;
            if(foc>=tc)
                foc=(tc-1);
        }
        else
            foc++;
        int min=Math.min(fc,ec);
        min=Math.min(fic,min);
        min=Math.min(min,sc);
        min=Math.min(min,tc);
        min=Math.min(foc,min);
        System.out.println(n-min*6);
}
}   