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

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
		StringBuilder sb = new StringBuilder(n*4);
		sb.append("w");
		for (int i = 0; i < arr.length; i++) {
			arr[i] = sc.nextInt();
			sb.append(arr[i]+"w");
		}
		long cnt = 0;
		int index1 = -1;
		int index2 = 0;
		int index3 = 0;
		int index4 = 0;
		int index5 = 0;
		int index6 = 0;
		while(true) {
			index1 = sb.indexOf("w4w" , index1+1);
			index2 = sb.indexOf("w8w" , index1 > index2 ? index1 : index2+1);
			index3 = sb.indexOf("w15w" , index2 > index3 ? index2 : index3+1);
			index4 = sb.indexOf("w16w" , index3 > index4 ? index3 : index4+1);
			index5 = sb.indexOf("w23w" , index4 > index5 ? index4 : index5+1);
			index6 = sb.indexOf("w42w" , index5 > index6 ? index5 : index6+1);
			if(index1 < 0 || index2 < 0 || index3 < 0 || index4 < 0 || index5 < 0 || index6 < 0) {
				break;
			}else {
				cnt++;
			}
		}
		System.out.println(n - cnt * 6);
		sc.close();
	}
}
 				 	 	 	 			 	  			 	 		 		