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())
arr = list(map(int, input().split()))
arr4 = []
arr8 = []
arr15 = []
arr16 = []
arr23 = []
arr42 = []
for q in range(n):
    if arr[q] == 4:
        arr4.append(q)
    elif arr[q] == 8:
        arr8.append(q)
    elif arr[q] == 15:
        arr15.append(q)
    elif arr[q] == 16:
        arr16.append(q)
    elif arr[q] == 23:
        arr23.append(q)
    else:
        arr42.append(q)
p4 = 0
p8 = 0
p15 = 0
p16 = 0
p23 = 0
p42 =0
count = 0
while p4 < len(arr4) and p8 < len(arr8) and p15 < len(arr15) and p16 < len(arr16) and p23 < len(arr23) and p42 < len(arr42):
    if  arr4[p4] < arr8[p8]:
        if arr8[p8] < arr15[p15]:
            if arr15[p15] < arr16[p16]:
                if arr16[p16] < arr23[p23]:
                    if arr23[p23] < arr42[p42]:
                        p4+=1
                        p8+=1
                        p15+=1
                        p16+=1
                        p23+=1
                        p42+=1
                        count+=1
                    else:
                        p42+=1
                else:
                    p23+=1
            else:
                p16+=1
        else:
            p15+=1
    else:
        p8+=1
print(n -6*count)
