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 giveand(arr, barr, dparr, i, j, n, m):
    
#     if i>=n or j>=m:
#         return 0
#     if (dparr[i][j]!=-1):
#         return dparr[i][j]
#     if (j==m-1):
#         if arr[i]==barr[j]:
#             dparr[i][j] = 1+giveand(arr,barr,dparr,i+1,j,n,m)
#             return dparr[i][j]
#         else:
#             dparr[i][j] = giveand(arr,barr,dparr,i+1,j,n,m)
#             return dparr[i][j]

#     if arr[i]==barr[j]:
#         dparr[i][j] = giveand(arr,barr,dparr,i+1,j+1,n,m)
#         return dparr[i][j]#+ giveand(arr,barr,dparr,i+1,j,n,m)
#     else:
#         dparr[i][j] = giveand(arr,barr,dparr,i+1,j,n,m)
#         return dparr[i][j]

# n = int(input()) 
# arr = list(map(int,input().split()))
# barr = [4,8,15,16,23,42]
# dparr=[[-1 for i in range(6)] for j in range(n)]
# num = giveand(arr,barr,dparr,0,0,n,6)
# #print(num)
# print(n-6*num)

def giveind(i):
    if i==8:
        return 4
    elif i==15:
        return 8
    elif i==16:
        return 15
    elif i==23:
        return 16
    elif i==42:
        return 23

n = int(input())
arr = list(map(int,input().split()))
cnt = {}
cnt[4] = 0
cnt[8] = 0
cnt[15] = 0
cnt[16] = 0
cnt[23] = 0
cnt[42] = 0

for i in range(n):
    if arr[i] == 4:
        cnt[4]+=1
    else:
        if cnt[giveind(arr[i])]>0:
            cnt[giveind(arr[i])]-=1
            cnt[arr[i]]+=1

# print(cnt[4],end=" ")
# print(cnt[8],end=" ")
# print(cnt[15],end=" ")
# print(cnt[16],end=" ")
# print(cnt[23],end=" ")
# print(cnt[42],end=" ")
# print()
ans = n-(6*cnt[42])
print(ans)
