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


seq_map = {
    4: 8,
    8: 15,
    15: 16,
    16: 23,
    23: 42,
    42: None,
}

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


def solve(l):
    subsequences = []
    to_delete = 0
    for item in l:
        for i in range(len(subsequences)):
            if seq_map[subsequences[i]] == item:
                subsequences[i] = item
                if subsequences[i] == 42:
                    subsequences.remove(subsequences[i])
                break
        else:
            if item == 4:
                subsequences.append(4)
            else:
                to_delete += 1

    return to_delete + sum([seq.index(s) + 1 for s in subsequences])


def solve_fasta(l):
    subseqs = {i: 0 for i in seq}
    for item in l:
        if item == 4 or subseqs[seq[seq.index(item) - 1]] > subseqs[item]:
            subseqs[item] += 1

    return n - 6 * min(subseqs.values())


if __name__ == "__main__":
    n = int(raw_input())
    l = map(int, raw_input().split())
    print(solve_fasta(l))
