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.*;

public class Main {
	static int[][] dp;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
		for(int i = 0; i < n; i++)
			arr[i] = sc.nextInt();
		dp = new int[6][n];
		int[] req = {4,8,15,16,23,42};
		System.out.println(n - wrap(arr, req) * req.length);
	}
	
	public static int wrap(int[] arr, int[] req)
	{
		for(int i = 0; i < arr.length; i++)
			func(arr, i, req);
		return dp[req.length-1][arr.length-1];
	}
	
	public static void func(int[] arr, int x, int[] req)
	{
		int r = 0;
		for(r = 0; r < req.length; r++)
			if(req[r] == arr[x])
				break;
		
		//if first element is treated and is first element of a sequence
		if(x == 0 && r == 0)
			dp[r][x] = 1;
		// first element is treated rn but it aint the first element of a sequence
		else if(x == 0)
			dp[r][x] = 0;
		else
		{
			// copy answers of past to now
			for(int i = 0; i < req.length; i++)
				dp[i][x] = dp[i][x-1];
			
			// initialize first element of a sequence
			if(r == 0)
				dp[r][x] = dp[r][x-1] + 1;
			// increment only if a sequence can be augmented
			else
			{
				if(dp[r-1][x-1] - dp[r][x-1] > 0)
					dp[r][x] = dp[r][x-1] + 1;
			}
		}
	}
}