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
'''input
15
4 8 4 8 15 16 8 16 23 15 16 4 42 23 42
'''
# its just a simulation
from sys import stdin, setrecursionlimit
import heapq



def refine(arr):
	aux = []
	for i in range(len(arr)):
		if arr[i] in [4, 8, 15, 16, 23, 42]:
			aux.append(arr[i])
	return aux

# main starts
n = int(stdin.readline().strip())
arr = list(map(int, stdin.readline().split()))
arr = refine(arr)
mydict = dict()
mydict[4] = 0; mydict[8] = 0; mydict[15] = 0; mydict[16] = 0;
mydict[23] = 0; mydict[42] = 0

for i in range(len(arr)):
	if arr[i] == 4:
		mydict[4] += 1
	elif arr[i] == 8:
		if mydict[4] >= mydict[8] + 1:
			mydict[8] += 1
	elif arr[i] == 15:
		if mydict[8] >= mydict[15] + 1:
			mydict[15] += 1

	elif arr[i] == 16:
		if mydict[15] >= mydict[16] + 1:
			mydict[16] += 1
	elif arr[i] == 23:
		if mydict[16] >= mydict[23] + 1:
			mydict[23] += 1
	elif arr[i] == 42:
		if mydict[23] >= mydict[42] + 1:
			mydict[42] += 1

print(n - mydict[42] * 6 )
