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())
a = [int(x) for x in input().split()]

four = []
egt = []
fif = []
six = []
thr = []
two = []


for i in range(n):
    if a[i] == 4:
        four.append(i)
    if a[i] == 8:
        egt.append(i)
    if a[i] == 15:
        fif.append(i)
    if a[i] == 16:
        six.append(i)
    if a[i] == 23:
        thr.append(i)
    if a[i] == 42:
        two.append(i)
if(len(four) == 0 or len(egt) == 0 or len(fif) == 0 or len(six) == 0 or len(thr) == 0 or len(two) == 0):
    print(n)
else:

    fo, eg, fi, si, th, tw = [0] * 6
    ans = 0
    mark = [0] * n
    while(True):
        if fo >= len(four) or eg >= len(egt) or fi >= len(fif) or si >= len(six) or th >= len(thr) or tw >= len(two):
            break
        if egt[eg] < four[fo] and eg < len(egt):
            while(eg < len(egt) and egt[eg]  < four[fo]):
                eg += 1
                ans += 1

            if eg >= len(egt):
                break
                
        if fif[fi] < egt[eg] and fi < len(fif):
            while(fi < len(fif) and fif[fi]  < egt[eg]):
                fi += 1
                ans += 1

            if fi >= len(fif):
                break

            
        if six[si] < fif[fi] and si < len(six):
            while(si < len(six) and six[si]  < fif[fi]):
                si += 1
                ans += 1

            if si >= len(six):
                break

            
        if thr[th] < six[si] and th < len(thr):
            while(th < len(thr) and thr[th]  < six[si]):
                th += 1
                ans += 1

            if th >= len(thr):
                break

            
        if two[tw] < thr[th] and tw < len(two):
            while(tw < len(two) and two[tw]  < thr[th]):
                tw += 1
                ans += 1

            if tw >= len(two):
                break

        #print(fo, eg, fi, si, th, tw, ans)
        mark[four[fo]] = 1
        mark[egt[eg]] = 1
        mark[fif[fi]] = 1
        mark[six[si]] = 1
        mark[thr[th]] = 1
        mark[two[tw]] = 1
        
        fo += 1
        eg += 1
        fi += 1
        si += 1
        th += 1
        tw += 1
    print(n - sum(mark)) 
