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.*;
import java.lang.*;
import java.io.*;


public class TestClass {
	static FastReader sc;
	static int mod = (int) Math.pow(10, 9) + 7;
	static BufferedWriter log;
	static int error;
	static int[] dp;
	public static void main(String[] args) throws IOException {
		log = new BufferedWriter(new OutputStreamWriter(System.out));
		sc = new FastReader();
//		int t = sc.nextInt();
		int t = 1;
		for (int i_t = 0; i_t < t; i_t++) {
			int n = sc.nextInt();
			int[] a=new int[n];
			for(int i=0;i<n;i++) {
				a[i]=sc.nextInt();
			}
			long ans = solve(n,a);
			log.write(ans + "\n");
//			log.write("Case #"+(i_t+1)+": " + ans + "\n");
		}
		log.flush();

	}

	


	private static long solve(int n, int[] a) {
		int ans=0;
		int x1=0,x2=0,x3=0,x4=0,x5=0,x6=0;
//		4,8,15,16,23,4
		for(int i=0;i<n;i++) {
			switch(a[i]) {
				case 4:x1++;break;
				case 8:if(x1>0){x2++;x1--;}else ans++;break;
				case 15:if(x2>0){x3++;x2--;}else ans++;break;
				case 16:if(x3>0){x4++;x3--;}else ans++;break;
				case 23:if(x4>0){x5++;x4--;}else ans++;break;
				case 42:if(x5>0){x6++;x5--;}else ans++;break;
				default:ans++;break;
			}
		}
     		x6*=6;
		return n-x6;
	}




	private static void pL(long l) throws IOException {
		log.write(Long.toString(l) + "\n");
	}

	public static void pA(int[] a, int n) throws IOException {
		for (int i = 1; i < n; i++) {
			log.write(a[i] + "");
		}
//		log.write("\n");
	}

	public static <T> void pA(T[] a, int n) throws IOException {
		for (int i = 0; i < n; i++) {
			log.write(a[i].toString() + "\n");
		}
		log.write("\n");
	}

	public static void pM(long[][] dp2, int n, int m) throws IOException {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				log.write(dp2[i][j] + " ");
			}
			log.write("\n");
		}
	}

}

class FastReader {
	BufferedReader br;
	StringTokenizer st;

	public FastReader() {
		br=new  BufferedReader(new InputStreamReader(System.in));
		
	}

	String next() {
		while (st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}

	int nextInt() {
		return Integer.parseInt(next());
	}

	long nextLong() {
		return Long.parseLong(next());
	}

	String nextLine() {
		String s = "";
		try {
			s = br.readLine();
		} catch (IOException e) {
			e.printStackTrace();
		}
		return s;
	}
}
