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
while(1):
    n=int(input())
    A=list(map(int,input().split(" ")))
    T=[4,8,15,16,23,42] 
    j=0
    l1=len(A)
    c1=0
    F=[0]*6
    for i in range(n):
        if(A[i]==4):
            F[0]+=1
        if(A[i]==8):
            F[1]+=1
        if(A[i]==15):
            F[2]+=1
        if(A[i]==16):
            F[3]+=1
        if(A[i]==23):
            F[4]+=1
        if(A[i]==42):
            F[5]+=1
    req=min(F)
    if(req==0):
        print(n)
        break
    B=[0]*6
    g=F[5]*6
    for i in range(n):
        if(i==l1-1):
            t1=c1
            t2=A[j]
            t3=j
        if(j==5):
            j=0
        if(A[i]==4):
            if(B[0]<req):
                B[0]+=1
            else:
                c1+=1
                #print(A[i], end=" ")
                continue
        if(A[i]==8):
            if(B[1]<req and B[1]<B[0]):
                B[1]+=1
            else:
                c1+=1
                #print(A[i], end=" ")
                continue
        if(A[i]==15):
            if(B[2]<req and B[2]<B[1]):
                B[2]+=1
            else:
                c1+=1
                #print(A[i], end=" ")
                continue
        if(A[i]==16):
            if(B[3]<req and B[3]<B[2]):
                B[3]+=1
            else:
                c1+=1
                #print(A[i], end=" ")
                continue
        if(A[i]==23):
            if(B[4]<req and B[4]<B[3]):
                B[4]+=1
                j=1
            else:
                c1+=1
                #print(A[i], end=" ")
                continue
        if(A[i]==42):
            if(B[5]<req and B[5]<B[4]):
                B[5]+=1
            else:
                c1+=1
                #print(A[i], end=" ")
                continue
    print(n-6*B[5])
    break