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.awt.Point;
import java.io.*;
import java.util.*;
public class Main {
	static PrintWriter out;
	static Scanner sc;
	static Queue<Integer>[] list;
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		sc = new Scanner(System.in);
		out = new PrintWriter(System.out);
		int n = sc.nextInt();
		list = new LinkedList[6];
		for(int i=0;i<6;i++)
			list[i] = new LinkedList<Integer>();
		for (int i = 0; i < n; i++) {
			int tmp = sc.nextInt();
			if(tmp == 4) {
				list[0].add(i);
			}else if(tmp == 8) {
				list[1].add(i);
			}else if(tmp == 15) {
				list[2].add(i);
			}else if(tmp == 16) {
				list[3].add(i);
			}else if(tmp == 23) {
				list[4].add(i);
			}else {
				list[5].add(i);
			}
		}
		while(solve(0, -1) == 0) {}
		for(Queue<Integer> l:list) {
			ans+=l.size();
		}
		out.println(ans);
		out.flush();
	}
	static int ans = 0;
	static int solve(int c,int last) {
		if(c == 6)
			return 0;
		Queue<Integer> q = list[c];
		while(!q.isEmpty()) {
			int e = q.peek();
			if(last<e) {
				int tmp = solve(c+1, e);
				if(tmp == 0)
					q.poll();
				return tmp;
			}else {
				q.poll();
				ans++;
			}
		}
		return -1;
	}
	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}

		public Scanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public String nextLine() throws IOException {
			return br.readLine();
		}

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

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public char nextChar() throws IOException {
			return next().charAt(0);
		}

		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}

}
