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 C_LoseIt {
	
	

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int dp[] = new int[6];
		int N = sc.nextInt();
		int ans = 0;
		
		for (int i = 0; i < N; i++) {
			int num = sc.nextInt();
			if (num == 4) {
				dp[0]++;
			} else if (num == 8) {
				if (dp[0] > dp[1]) {
					dp[1]++;
				} else ans++;
			} else if (num == 15) {
				if (dp[1] > dp[2]) {
					dp[2]++;
				} else ans++;
				
			} else if (num == 16) {
				if (dp[2] > dp[3]) {
					dp[3]++;
				} else ans++;
			} else if (num == 23) {
				if (dp[3] > dp[4]) {
					dp[4]++;
				} else ans++;
				
			} else if (num == 42) {
				if (dp[4] > dp[5]) {
					dp[5]++;
				} else ans++;
			}
		}
		
		for(int i = 0 ; i < 5 ; i++) {
			if(dp[i] > dp[5]) {
				ans += (dp[i] - dp[5]);
			}
		}
		
		System.out.print(ans);
	}

}
