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 bisect import bisect_left

N = int(input())
ls = list(map(int, input().split()))
d4 = []
d8 = []
d15 = []
d16 = []
d23 = []
d42 = []
for i in range(len(ls)):
    if ls[i]==4: d4.append(i)
    elif ls[i]==8: d8.append(i)
    elif ls[i]==15: d15.append(i)
    elif ls[i]==16: d16.append(i)
    elif ls[i]==23: d23.append(i)
    else: d42.append(i)
cnt = 0
j = 0; k = 0; l = 0; m = 0; n = 0
for i in d4:
    pos = bisect_left(d8, i, lo=j)
    if pos==len(d8): break
    i = d8[pos]
    j = pos+1
    pos = bisect_left(d15, i, lo=k)
    if pos==len(d15): break
    i = d15[pos]
    k = pos+1
    pos = bisect_left(d16, i, lo=l)
    if pos==len(d16): break
    i = d16[pos]
    l = pos+1
    pos = bisect_left(d23, i, lo=m)
    if pos==len(d23): break
    i = d23[pos]
    m = pos+1
    pos = bisect_left(d42, i, lo=n)
    if pos==len(d42): break
    n = pos+1
    cnt+=1
print(N-6*cnt)
