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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class c565 {
	public static void main(String[] args) throws IOException {	
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int n = Integer.parseInt(br.readLine());
		int[] count = new int[7];		

		String[] input = br.readLine().split(" ");
		for(int i=0 ; i<n ; i++){
			int now = Integer.parseInt(input[i]);
			switch(now){
			case 4:
				count[1]++; 
				break;
			case 8:
				if(count[1]!=0){
					count[1]--;
					count[2]++;
				}
				else{
					count[0]++;
				}
				break;
			case 15:
				if(count[2]!=0){
					count[2]--;
					count[3]++;
				}
				else{
					count[0]++;
				}
				break;
			case 16:
				if(count[3]!=0){
					count[3]--;
					count[4]++;
				}
				else{
					count[0]++;
				}
				break;
			case 23:
				if(count[4]!=0){
					count[4]--;
					count[5]++;
				}
				else{
					count[0]++;
				}
				break;
			case 42:
				if(count[5]!=0){
					count[5]--;
					count[6]++;
				}
				else{
					count[0]++;
				}
				break;
			}
		}
		int result = 0;
		result += count[0];
		for(int i=1 ; i<6 ; i++){
			result += count[i]*(i);
		}
		System.out.println(result);
	}
}
