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=int(input())

s=input()
s1=s.split()
l=[int(i) for i in s1]

d=[4,8,15,16,23,42]

dp={}

for i in range(len(l)):

    if l[i]==4:

        if 4 not in dp:

            dp[4]=1

        else:
            dp[4]=dp[4]+1

    
    if l[i]==8:

        if 4 in dp and 8 not in dp:

            dp[8]=1

        elif 4 in dp and dp[8]<dp[4]:

            dp[8]=dp[8]+1

    if l[i]==15:

        if 8 in dp and 15 not in dp:

            dp[15]=1

        elif 8 in dp and dp[15]<dp[8]:

            dp[15]=dp[15]+1


    if l[i]==16:

        if 15 in dp and 16 not in dp:

            dp[16]=1

        elif 16 in dp and dp[16]<dp[15]:

            dp[16]=dp[16]+1


    if l[i]==23:

        if 16 in dp and 23 not in dp:

            dp[23]=1

        elif 23 in dp and dp[23]<dp[16]:

            dp[23]=dp[23]+1

    if l[i]==42:

        if 23 in dp and 42 not in dp:

            dp[42]=1

        elif 42 in dp and dp[42]<dp[23]:

            dp[42]=dp[42]+1

if 42 in dp:
    print(len(l)-6*dp[42])
else:
    print(len(l))
