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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class C {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		List<Integer> first = new ArrayList<>();
		List<Integer> second = new ArrayList<>();
		List<Integer> third = new ArrayList<>();
		List<Integer> fourth = new ArrayList<>();
		List<Integer> fifth = new ArrayList<>();
		List<Integer> sixth = new ArrayList<>();

		
		
		for (int i = 0; i < n; i++) {
			int el = sc.nextInt();
			switch (el) {
			case 4:
				first.add(i);
				break;
			case 8:
				second.add(i);
				break;
			case 15:
				third.add(i);
				break;
			case 16:
				fourth.add(i);
				break;
			case 23:
				fifth.add(i);
				break;
			case 42:
				sixth.add(i);
				break;
			}
		}

		List<List<Integer>> values = new ArrayList<>();
		values.add(first);
		values.add(second);
		values.add(third);
		values.add(fourth);
		values.add(fifth);
		values.add(sixth);
		
		List<Integer> indices = new ArrayList<>();
		indices.add(0);
		indices.add(0);
		indices.add(0);
		indices.add(0);
		indices.add(0);
		indices.add(0);

		int previousValue = -1;
		int currentNumber = 0;
		int usedElements = 0;
		boolean foundOne = false;
		while (true) {
			// check if possible to form a new sequence
			int currentIndex = indices.get(currentNumber);
			if (currentIndex >= values.get(currentNumber).size()) {
				// unable to continue
				break;
			}
			
			int currentValue = values.get(currentNumber).get(currentIndex);
			
			// found a correct sequence
			if(currentValue > previousValue) {
				indices.set(currentNumber, indices.get(currentNumber)+1);
				previousValue = currentValue;
				currentNumber++;
			}
			else {
				// try to find more suitable index for correct sequence
				indices.set(currentNumber, indices.get(currentNumber)+1);
			}

			if(currentNumber == 6) {
				foundOne = true;
				usedElements += 6;
				previousValue = -1;
			}

			currentNumber %= 6;
		}

		if(!foundOne) {
			System.out.println(n);
		} else {
			System.out.println(n-usedElements);
		}
	}

}
