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

n=int(input())
a=list(map(int,input().split(" ")))


4,8,15,16,23,42
l=[]

for i in range(6):
	l.append([])

for i in range(n):
	if(a[i]==4):
		l[0].append(i)
	elif(a[i]==8):
		l[1].append(i)
	elif(a[i]==15):
		l[2].append(i)
	elif(a[i]==16):
		l[3].append(i)
	elif(a[i]==23):
		l[4].append(i)
	else:
		l[5].append(i)

mn=-1

tot=0

flg=0

i=0

indx1=0
indx2=0
indx3=0
indx4=0
indx5=0
indx6=0


while(flg==0):
	if(i%6==0):
		if(indx1>=len(l[0])):
			flg=1
		else:
			mn=l[0][indx1]
			indx1+=1
	elif(i%6==1):
		if(indx2>=len(l[1])):
			flg=1
		else:
			while(indx2<len(l[1]) and mn>l[1][indx2]):
				indx2+=1
			if(indx2>=len(l[1])):
				flg=1
			else:
				mn=l[1][indx2]
				indx2+=1
	elif(i%6==2):
		if(indx3>=len(l[2])):
			flg=1
		else:
			while(indx3<len(l[2]) and mn>l[2][indx3]):
				indx3+=1
			if(indx3>=len(l[2])):
				flg=1
			else:
				mn=l[2][indx3]
				indx3+=1
	elif(i%6==3):
		if(indx4>=len(l[3])):
			flg=1
		else:
			while(indx4<len(l[3]) and mn>l[3][indx4]):
				indx4+=1
			if(indx4>=len(l[3])):
				flg=1
			else:
				mn=l[3][indx4]
				indx4+=1
	elif(i%6==4):
		if(indx5>=len(l[4])):
			flg=1
		else:
			while(indx5<len(l[4]) and mn>l[4][indx5]):
				indx5+=1
			if(indx5>=len(l[4])):
				flg=1
			else:
				mn=l[4][indx5]
				indx5+=1
	else:
		if(indx6>=len(l[5])):
			flg=1
		else:
			while(indx6<len(l[5]) and mn>l[5][indx6]):
				indx6+=1
			if(indx6>=len(l[5])):
				flg=1
			else:
				mn=l[5][indx6]
				tot+=1
				indx6+=1
	i+=1

print(n-(6*tot))
