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
def ain():
    return map(int,input().split())
def lin():
    return list(ain())


# def plist(l):
#     for x in l:
#         print(x, end= ' ')
#             print()

def indexof(l,v,l3):
    return l3[v]


n = int(input())
l = lin()
l1 = [[],[],[],[],[],[]]
#print(l1)
for i in range(n):
    x = l[i]
    if x == 4:
        l1[0] += [i]
    if x == 8:
        l1[1] += [i]
    if x == 15:
        l1[2] += [i]
    if x == 16:
        l1[3] += [i]
    if x == 23:
        l1[4] += [i]
    if x == 42:
        l1[5] += [i]
yu = 0
for x in l1:
    if len(x) == 0:
        yu=1
        break

p = [0,0,0,0,0,0]
c = 0

if yu == 0:
    while 1:
        f = 0
        if p[5] >= len(l1[5]):
            f = 1
        else:
            for i in range(0,5):
                if p[i] >= len(l1[i]) or p[i+1] >= len(l1[i+1]):
                    f = 1
                    break
                while l1[i][ p[i] ] > l1[i+1][ p[i+1] ]:
                    p[i+1] += 1
                    if p[i+1] >= len(l1[i+1]):
                        f = 1
                        break
                
                p[i] += 1
                if i == 4:
                    p[i+1] += 1
        
        if f == 0:
            c += 1
        else:
            break
        #print(p)
    print(n - 6*c)
else:
    print(n)
