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.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class CFLooseIt {
	
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int[] nums = new int[n];
		for(int i = 0; i < n; i++) {
			nums[i] = scanner.nextInt();
		}
		int count = 0;
		HashMap<Integer, Integer> reffer = new HashMap<>();
		HashMap<Integer, Integer> counter = new HashMap<>();
		counter.put(8, 1);
		counter.put(15, 2);
		counter.put(16, 3);
		counter.put(23, 4);
		counter.put(42, 5);
		reffer.put(4, 0);
		reffer.put(8, 0);
		reffer.put(15, 0);
		reffer.put(16, 0);
		reffer.put(23, 0);
		reffer.put(42, 0);
		int[] order = {4,8,15,16,23,42};
		for(int num : nums) {
			if(reffer.containsKey(num)) {
				int index = Arrays.binarySearch(order, num);
				if(num == 42 && reffer.get(42) > 0) {
					reffer.put(42, reffer.get(42)-1);
				}
				else if(reffer.get(num) > 0 || num == 4) {
					reffer.put(num, reffer.get(num)-1);
					reffer.put(order[index+1], reffer.get(order[index+1])+1);
				}
				else {
					count++;
				}
				
			}
			else {
				count++;
			}
		}
		for(Integer key : reffer.keySet()) {
			if(key != 4) {
				count += reffer.get(key)*counter.get(key);
			}
		}
		System.out.println(count);
		scanner.close();
	}

}
