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

public class Main
{
	static final long mod=(int)1e9+7;
	static int ans=0;
	static ArrayList<Integer>[] adj;
	static int[] p;
	public static void main(String[] args) throws Exception
	{
		FastReader in=new FastReader();
		PrintWriter pw=new PrintWriter(System.out);
		int n=in.nextInt();
		int[] arr=new int[n];
		adj=new ArrayList[43];
		adj[4]=new ArrayList();
		adj[8]=new ArrayList();
		adj[15]=new ArrayList();
		adj[16]=new ArrayList();
		adj[23]=new ArrayList();
		adj[42]=new ArrayList();
		for(int i=0;i<n;i++)
		{
			arr[i]=in.nextInt();
			adj[arr[i]].add(i);
		}
		p=new int[43];
		for(int i:adj[4])
		{
			solve(i,8);
		}
		pw.print(n-ans);
		pw.flush();
	}

	static void solve(int a,int b)
	{
		while(p[b]<adj[b].size() && adj[b].get(p[b])<a)
			p[b]++;
		if(p[b]<adj[b].size())
		{
			if(b==42)
				ans+=6;
			else if(b==8)
				solve(adj[b].get(p[b]),15);
			else if(b==15)
				solve(adj[b].get(p[b]),16);
			else if(b==16)
				solve(adj[b].get(p[b]),23);
			else if(b==23)
				solve(adj[b].get(p[b]),42);
			p[b]++;
		}
	}
}

class FastReader
{
	BufferedReader br;
	StringTokenizer st;

	public FastReader()
	{
	    br=new BufferedReader(new InputStreamReader(System.in));
	}

	public String next() throws IOException
	{
	    if(st==null || !st.hasMoreElements())
	    {
	        st=new StringTokenizer(br.readLine());
	    }
	    return st.nextToken();
	}

	public int nextInt() throws IOException
	{
	    return Integer.parseInt(next());
	}

	public long nextLong() throws IOException
	{
	    return Long.parseLong(next());
	}
}