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 math
import collections
import bisect
 
 
 
def cint() : return list(map(int, input().split())) 
def cstr() : return list(map(str, input().split(' '))) 
 

def solve():
    n = int(input())
    lst = cint()
    # default =(4,8,15,16,23,42)
    stk = [[] for i in range(6)]

    for i in range(n):
        if lst[i]==4:
            stk[0].append(i)


        elif lst[i]==8 and len(stk[0]) > len(stk[1]):
            stk[1].append(i)


        elif lst[i]==15:
            isempty=0
            for j in range(2):
                if len(stk[j]) <= len(stk[2]):
                    isempty=1
                    break
            if isempty==0:
                stk[2].append(i)


        elif lst[i]==16:
            isempty=0
            for j in range(3):
                if  len(stk[j]) <= len(stk[3]):
                    isempty=1
                    break
            if isempty==0:
                stk[3].append(i)


        elif lst[i]==23:
            isempty=0
            for j in range(4):
                if  len(stk[j]) <= len(stk[4]):
                    isempty=1
                    break
            if isempty==0:
                stk[4].append(i)


        elif lst[i]==42:
            isempty=0
            for j in range(5):
                if len(stk[j]) <= len(stk[5]): 
                    isempty=1
                    break
            if isempty==0:
                stk[5].append(i)

    
    minlst = []
    for s in stk:
        minlst.append(len(s))
    
    # print(minlst, stk)
    print(n-6*min(minlst))
        
            

    



   


if __name__ == "__main__":
    # t = int(input())
    t = 1
    while t!=0:
        solve()
        t-=1