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=eval(input())
str=input()
l=str.split()
cl=[]
a,b,c,d,e,f='4','8','15','16','23','42'
p,q,r,s,t,u=0,0,0,0,0,0
sum=0
for x in range(len(l)):
    if l[x]==a:
        cl.append([a])
    elif l[x]==b:
        if p<len(cl) and cl[p]==[a]:
            cl[p].append(b)
            p+=1
        else:
            sum+=1
    elif l[x]==c:
        if q<len(cl) and cl[q]==[a,b]:
            cl[q].append(c)
            q+=1
        else:
            sum+=1
    elif l[x]==d:
        if r<len(cl)and cl[r]==[a,b,c]:
            cl[r].append(d)
            r+=1
        else:
            sum+=1
    elif l[x]==e:
        if s<len(cl) and cl[s]==[a,b,c,d]:
            cl[s].append(e)
            s+=1
        else:
            sum+=1
    elif l[x]==f:
        if t<len(cl) and cl[t]==[a,b,c,d,e]:
            cl[t].append(f)
            t+=1
        else:
            sum+=1
    else:
        sum+=1
for x in range(len(cl)):
    if cl[x]!=[a,b,c,d,e,f]:
        sum+=len(cl[x])
print(sum)
