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 Round_565_Div3_C {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] array = new int[n];
		int[] numberArray = new int[6];
		int count4 = 0;
		int count8 = 0;
		int count15 = 0;
		int count16 = 0;
		int count23 = 0;
		int count42 = 0;
		int not = 0;
		
		for ( int i = 0; i < n; i++ ){
			int temp = sc.nextInt();
			array[i] = temp;
		}
		
		for ( int i = 0; i < n; i++ ){
			if ( array[i] == 4 ){
				count4++;
				numberArray[0]++;
			}
			else if ( array[i] == 8 && count8 < count4){
				count8++;
				numberArray[1]++;
			}
			else if ( array[i] == 15 && count15 < count4 && count15 < count8 ){
				count15++;
				numberArray[2]++;
			}
			else if ( array[i] == 16 && count16 < count4 && count16 < count8 && count16 < count15 ){
				numberArray[3]++;
				count16++;
			}
			else if ( array[i] == 23 && count23 < count4 && count23 < count8 && count23 < count15 && count23 < count16){
				numberArray[4]++;
				count23++;
			}
			else if ( array[i] == 42 && count42 < count4 && count42 < count8 && count42 < count15 && count42 < count16 && count42 < count23)
			{
				numberArray[5]++;
				count42++;
			}else{
				not++;
			}
		}
		
		if ( count4 >= 1 && count8 >= 1 && count15 >= 1 && count16 >= 1 && count23 >= 1 && count42 >= 1 ){
			int count = 0;
			int min = Integer.MAX_VALUE;
			
			for ( int i = 0; i < 6; i++ ){
				if ( numberArray[i] < min )
					min = numberArray[i];
			}
			for ( int i = 0; i < 6; i++ ){
				if ( numberArray[i] >= min )
					not = not + numberArray[i] - min;
			}

			for ( int i = 0; i <= not; i++ ){
				if ( (n - (min * 6) - i) % 6 == 0 ){
					System.out.println(n - (min * 6));
					return;
				}
			}
		}
		System.out.println(n);
		
		
		/*
		if ( count4 >= 1 && count8 >= 1 && count15 >= 1 && count16 >= 1 && count23 >= 1 && count42 >= 1){
			boolean flag = true;
			int first = numberArray[0];
			int min = Integer.MAX_VALUE;
			
			for (int i = 1; i < 6; i++ ){
				if ( first != numberArray[i] ){
					flag = false;
					break;
				}
			}
			
			System.out.println(flag);
			
			if ( flag ){
				//[4~42, 4~42 * 5]
				// n = 30;
				// n - numberarray[0]*6 = 0
				// 12 - (12 - 2 * 6) % 6 == 0 
				// 12 - (12 - 2 * 6) % 6 == 0  
				if ( (n - (n - numberArray[0] * 6)) % 6 == 0 ){
					System.out.println(n - (numberArray[0] * 6) );
					System.out.println("asdF");
				}else{
					System.out.println("asdfasdf");
					System.out.println(n);
				}
			}else{
				int count = 0;
				for ( int i = 0; i < 6; i++ ){
					if ( numberArray[i] < min )
						min = numberArray[i];
				}
				for ( int i = 0; i < 6; i++ ){
					if ( numberArray[i] >= min )
						count = count + numberArray[i] - min;
				}
				
				if ( n - (n - min * 6 - count) % 6 == 0 )
					System.out.println(n - min * 6 - count);
				else
					System.out.println(n);
			}
		}else{
			System.out.println(n);
		}
		*/
	}
}
