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()))
r=[0,0,0,0,0,0]
ans=0
cnt=0
b=[[],[],[],[],[],[]]
if n<6:
  print(n)
  exit()
for i in range(n):
  if a[i] ==4:
    b[0].append(i)
  elif a[i]== 8:
    b[1].append(i)  
  elif a[i]== 15:
    b[2].append(i) 
  elif a[i]== 16:
    b[3].append(i) 
  elif a[i]== 23:
    b[4].append(i)
  elif a[i]== 42:
    b[5].append(i)      
for i in range(len(b[0])):
  if ans!=0:
    break
  c=b[0][i]
  
  for j in range(1,6):
    l=len(b[j])
    if ans==-1:
      break
    if r[j]==l:
      ans=1
      break
    for k in range(l):
      if b[j][r[j]]>c:
        c=b[j][r[j]]
        r[j]+=1
        #b[j].pop(0)
        break
         
      else:
        r[j]+=1
        #b[j].pop(0)
        if len(b[j])==r[j]:
          ans=-1
          break
      
    if j==5 and ans==0:
      cnt+=1      
print(n-(6*cnt))    






 