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

"""
def fun(s,l):
      d={'A' : 0, 'P' : 0}
      proxy_possible = 0
      for i in range(l):
            d[s[i]]+=1
            if s[i]=='A':
                  if i-2>=0 and i+2 <l:
                        if s[i-1]=='P' or s[i-2]=='P':
                              if s[i+1]=='P' or s[i+2]=='P':
                                    proxy_possible+=1
      org=d['P']
      while proxy_possible :
            if (float(org)/l) >= 0.75:
                  return (org-d['P'])
            else :
                  org+=1
                  proxy_possible-=1
      
      if (float(org)/l)<0.75:
            return -1
      else :
            return org-d['P']  
                  
x=int(input())
for i in range(x):
      l=int(input())
      s=input()
      print(fun(s,l))
"""
"""
import itertools 
def sumtoten(n): 
	c = 0
	for num in itertools.count(): 
		s = 0
		x = num 
		while(x): 
			s = s + x % 10
			x = x // 10
		if (s == 10): 
			c = c + 1
		if (c == n): 
			return num
x=int(input())
for i in range(x):
      print(sumtoten(int(input())))
"""

"""
def fun(n,a):
      m=[0,0,0]
      for i in a:
            m[i%3]+=1
      return (m[0]+min(m[1], m[2])+ abs(m[1]-m[2])//3)



n=int(input())
for i in range(n):
      print(fun(int(input()), list(map(int , input().split())) ))
"""
"""
def devil(n,a):
      tobe=["4","8","15","16","23","42"]
      x=0
      m=[]
      i=0
      while i<n:
            if a[i] == tobe[x]:
                  m.append(i)
                  x+=1
            if x==6:
                  b=0
                  for j in m:
                        a.pop(j-b)
                        b+=1
                  i=-1
                  x=0
                  n-=6
                  m=[]
            i+=1
      return a

u=devil(int(input()),input().split(" "))          

print(len(u))
"""
def fcukof(n):
      a=input().split(" ")
      x=[0]*6
      for i in a:
            if i=='4':
                  x[0]+=1 
            elif i=='8' and x[0]>x[1]:
                  x[1]+=1
            elif i=='15' and x[1]>x[2]:
                  x[2]+=1
            elif i=='16' and x[2]>x[3]:
                  x[3]+=1
            elif i=='23' and x[3]>x[4]:
                  x[4]+=1
            elif i=='42' and x[4]>x[5]:
                  x[5]+=1
      return n-(6*x[5])


x=int(input())
print(fcukof(x))








