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
import sys
input = sys.stdin.readline

n=int(input())
A=list(map(int,input().split()))

B=[]
C=[]
D=[]
E=[]
F=[]
G=[]

for i in range(n):
    if A[i]==4:
        B.append(i)

    if A[i]==8:
        C.append(i)

    if A[i]==15:
        D.append(i)

    if A[i]==16:
        E.append(i)

    if A[i]==23:
        F.append(i)

    if A[i]==42:
        G.append(i)

NOW=0
Bi=0
Ci=0
Di=0
Ei=0
Fi=0
Gi=0

ANS=0

while True:
    
    for b in range(Bi,len(B)):
        NOW=B[b]
        Bi=b+1
        break
    else:
        break

    #print("!")

    for c in range(Ci,len(C)):
        if C[c]>=NOW:
            NOW=C[c]
            Ci=c+1
            break
    else:
        break

    for d in range(Di,len(D)):
        if D[d]>=NOW:
            NOW=D[d]
            Di=d+1
            break
    else:
        break

    for e in range(Ei,len(E)):
        if E[e]>=NOW:
            NOW=E[e]
            Ei=e+1
            break
    else:
        break

    for f in range(Fi,len(F)):
        if F[f]>=NOW:
            NOW=F[f]
            Fi=f+1
            break
    else:
        break

    for g in range(Gi,len(G)):
        if G[g]>=NOW:
            NOW=G[g]
            Gi=g+1
            break
    else:
        break

    ANS+=6

print(len(A)-ANS)

    
