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())
s = input()
arr = s.split(" ")
for i in range(n):
    arr[i] = int(arr[i])
arr4 = []
arr8 = []
arr15 = []
arr16 = []
arr23 = []
arr42 = []
maxm = 0
ans=0
temp = n//6
for i in range(n):
    if arr[i]==4:
        if (len(arr4)+1)>temp:
            ans = ans + 1
        else:
            arr4.append(arr[i])
    if arr[i]==8:
        if (len(arr8)+1)>temp:
            ans=ans+1
        else:
            if(len(arr8)+1)<=len(arr4):
                arr8.append(8)
            else:
                ans = ans+1
    if arr[i]==15:
        if (len(arr15)+1)>temp:
            ans=ans+1
        else:
            if(len(arr15)+1)<=len(arr8) and (len(arr15)+1)<=len(arr4):
                arr15.append(15)
            else:
                ans = ans+1
    if arr[i]==16:
        if (len(arr16)+1)>temp:
            ans=ans+1
        else:
            if(len(arr16)+1)<=len(arr15) and (len(arr16)+1)<=len(arr8) and (len(arr16)+1)<=len(arr4):
                arr16.append(16)
            else:
                ans = ans+1
    if arr[i]==23:
        if (len(arr23)+1)>temp:
            ans=ans+1
        else:
            if(len(arr23)+1)<=len(arr16) and (len(arr23)+1)<=len(arr15) and (len(arr23)+1)<=len(arr8) and (len(arr23)+1)<=len(arr4):
                arr23.append(23)
            else:
                ans = ans+1
    if arr[i]==42:
        if (len(arr42)+1)>temp:
            ans=ans+1
        else:
            if(len(arr42)+1)<=len(arr23) and (len(arr42)+1)<=len(arr16) and (len(arr42)+1)<=len(arr15) and (len(arr42)+1)<=len(arr8) and (len(arr42)+1)<=len(arr4):
                arr42.append(42)
            else:
                ans = ans+1

minm = n
if len(arr4)<minm:
    minm = len(arr4)
if len(arr8)<minm:
    minm = len(arr8)
if len(arr15)<minm:
    minm = len(arr15)
if len(arr16)<minm:
    minm = len(arr16)
if len(arr23)<minm:
    minm = len(arr23)
if len(arr42)<minm:
    minm = len(arr42)

ans = ans + (len(arr4)-minm) + (len(arr8)-minm) + (len(arr15)-minm) + (len(arr16)-minm) +(len(arr23)-minm) + (len(arr42)-minm)
print(ans)








    














                
