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.*;
public class Main{
	public static void main(String args[]){
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		ArrayList<Integer>[] b = new ArrayList[6];
		for(int i=0; i<6; i++) b[i] = new ArrayList<>();

		// 4,8,15,16,23,42.
		int a[] = new int[n];
		int count = 0;
		for(int j=0; j<n; j++){
			a[j] = in.nextInt();
			if(a[j] == 4){
				b[0].add(j);
			} else if(a[j] == 8){
				b[1].add(j);
			} else if(a[j] == 15){
				b[2].add(j);
			} else if(a[j] == 16){
				b[3].add(j);
			} else if(a[j] == 23){
				b[4].add(j);
			} else if(a[j] == 42){
				b[5].add(j);
			}
		}

		int ix[] = new int[6];
		while(b[0].size() > ix[0]){
			outer:
			while(b[1].size() > ix[1]){
				
				if(b[1].get(ix[1]) > b[0].get(ix[0])){
					while(b[2].size() > ix[2]){
						
						if(b[2].get(ix[2]) > b[1].get(ix[1])){
							while(b[3].size() > ix[3]){
								
								if(b[3].get(ix[3]) > b[2].get(ix[2])){
									while(b[4].size() > ix[4]){
										
										if(b[4].get(ix[4]) > b[3].get(ix[3])){
											while(b[5].size() > ix[5]){
												
												if(b[5].get(ix[5]) > b[4].get(ix[4])){
													count+=6;
													ix[5]++;
													ix[4]++;
													ix[3]++;
													ix[2]++;
													ix[1]++;
													break outer;
												}
												ix[5]++;
											}
										}
										ix[4]++;
									}
								}
								ix[3]++;
							}
						}
						ix[2]++;
					}
				}
				ix[1]++;
			}
			ix[0]++;
		}

		System.out.println(n-count);
	}
}
