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
"Codeforces Round #623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine)"
"B. Homecoming"
# y=int(input())
# for i in range(y):
#     a,b,p=map(int,input().split())
#     s=list(input())
#     l=len(s)
#     #A-65
#     if p<a and p<b:
#         print(l)
#         continue
#     q=s[-1]
#     if s.count(q)==l:
#         if q=="A" and p>=a:
#             print(1)
#         elif q=="B" and p>=b:
#             print(1)
#         else:
#             print(l)    
#         continue
#     f=0
#     for j in range(0,l):
#         t=l-1-j
#         qs=chr(131-ord(q))
#         print("--->",t,q,s[t],p)
#         if (p<a and p<b) or (p<1):
#             if t==0:
#                 print(t+1)
#                 f=1
#                 break
#             print(t+2)
#             f=1
#             break
#         elif j==0 and q==s[-2]:
#             if q=="A":
#                 p-=a
#             else:
#                 p-=b
#         elif j==0 and qs==s[-2]:
#             if q=="A":
#                 p-=b
#             else:
#                 p-=a
#             q=qs
#         elif j==l-1:
#             pass        
#         elif s[t]==qs and s[t-1]==q:
#             if qs=="A":
#                 p-=a
#             else:
#                 p-=b  
#             q=qs
#     if f==0:         
#         print(1)                   
"Codeforces Round #565 (Div. 3)"
"C. Lose it!"
y=int(input())
a=list(map(int,input().split()))
t=[4,8,15,16,23,42]
ans=0
d={}
for i in t:
    d.setdefault(i,0)
# e=int(y/6)
# p=[-1]*e
# print(p)
for i in a:
    indx=t.index(i)
    # f=0
    if indx>0:
        if d[t[indx-1]]>d[t[indx]]:
            d[t[indx]]+=1
        else:
            ans+=1
    elif indx==0:
        d[4]+=1

    # for j in range(e):
    #     if p[j]+1==indx:
    #         p[j]+=1
    #         f=1
    #         break
    # if f==0:
    #     ans+=1
mini=d[42]        
for i in d.keys():
    ans=ans+d[i]-mini
print(ans)                   


