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
from collections import defaultdict
def find(li):
	k = {4:0,8:1,15:2,16:3,23:4,42:5}
	temp = li.count(4)
	stacks = []
	for i in range(5*10**5):
		stacks.append([])
	d = defaultdict(int)
	for i in range(len(li)):
		temp = d[li[i]]
		potentialStack = stacks[temp]
		index = k[li[i]]
		if index == 0:
			potentialStack.append(li[i])
			d[li[i]]+=1
		else:
			if len(potentialStack)!=0 and k[potentialStack[-1]] == index-1:
				potentialStack.append(li[i])
				d[li[i]]+=1
	ans = 0
	for i in stacks:
		if len(i)==6:
			ans+=6
	return len(li) - ans

x = int(input())
li = list(map(int,input().split()))
print(find(li))
