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
t = int(input())
a = [int(x) for x in input().split()]
xx = [4, 8, 15, 16, 23, 42]
y = {x: [] for x in xx}
for i in range(len(a)):
    if a[i] in y:
        y[a[i]].append(i)
ans = 0
l8 = 0
l15 = 0
l16 = 0
l23 = 0
l42 = 0
#print(y)
for i in y[4]:
    l8 = max(l8, i)
    l8 = bisect(y[8], l8)
#    print('index l8', l8)
    if l8 == len(y[8]):
        break
    l8 = y[8][l8]
#    print('value l8', l8)
    l15 = max(l15, l8)
    l15 = bisect(y[15], l15)
    if l15 == len(y[15]):
        break
    l15 = y[15][l15]
    l16 = max(l16, l15)
    l16 = bisect(y[16], l16)
    if l16 == len(y[16]):
        break
    l16 = y[16][l16]
    l23 = max(l23, l16)
    l23 = bisect(y[23], l23)
    if l23 == len(y[23]):
        break
    l23 = y[23][l23]
    l42 = max(l42, l23)
    l42 = bisect(y[42], l42)
    if l42 == len(y[42]):
        break
    l42 = y[42][l42]
#    print(i, l8, l15, l16, l23, l42)
    ans += 1
ans = len(a) - 6 * ans
print(ans)



