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
t = [4,8,15,16,23,42]

from collections import defaultdict

n = int(input())
l = list(map(int,input().split()))

j = 0
c = 0
for i in range(n):		
	if l[i] == t[j]:
		j = j + 1
	else:
		c = c + 1
	if j == 6:
		j = 0
# print
dp = [[] for i in range(6)]

for i in range(n):
	for j in range(6):
		if t[j] == l[i]:
			dp[j].append(i)
			break
# print(dp)
d = {}
# print(dp)
for i in range(1,6):
	temp = []
	j = 0
	k = 0
	while j < len(dp[i-1]) and k < len(dp[i]):
		# print(j,i,k)
		# while k < len(dp[i]):
		if dp[i-1][j] < dp[i][k]:
			temp.append(dp[i][k])
			j = j + 1
			k = k + 1
			
		elif dp[i-1][j] > dp[i][k]:
			k = k + 1
	if len(temp) == 0:
		dp[i] = list(temp)
		# break
	else:
		dp[i] = list(temp)
# print(dp)
# print(dp)
z = float("inf")
for i in range(6):
	z = min(z,len(dp[i]))
print(n-z*6)
