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
from collections import defaultdict

def go():
    n = int(input())
    keys = [4, 8, 15, 16, 23, 42]
    keep = defaultdict(list)
    for i, e in enumerate(input().split(' ')):
        keep[int(e)].append(i)
    for k in keys:
        keep[k].reverse()
    to_remove = 0
    current = []
    index = 0
    while True:
        if len(current) == 6:
            for i in range(5):
                while current[i] > current[i + 1]:
                    if len(keep[keys[i + 1]]) > 0:
                        current[i + 1] = keep[keys[i + 1]].pop()
                        to_remove += 1
                    else:
                        break
            s_current = sorted(current)
            if s_current == current:
                current = []
                index = 0
            else:
                break
        if len(keep[keys[index]]) > 0:
            current.append(keep[keys[index]].pop())
            index += 1
        else:
            break
    return len(current) + sum(len(i) for i in keep.values()) + to_remove

print(go())
