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 solution():
    d = {4: 0, 8: 0, 15: 0, 16: 0, 23: 0, 42: 0}
    n = int(input())
    a = list(map(int, input().split()))
    dp = [[0]*(7) for i in range(n+1)]
    ans = n
    for i in range(n):
        num = a[i]
        if num == 4:
            dp[i+1][1] = dp[i][1] + 1
            for j in range(2, 7):
                dp[i+1][j] = dp[i][j]
        elif num == 8:
            if dp[i][1] > 0:
                dp[i+1][1] = dp[i][1] - 1
                dp[i+1][2] = dp[i][2] + 1
                for j in range(1, 7):
                    if j != 1 and j != 2:
                        dp[i+1][j] = dp[i][j]
            else:
                dp[i+1] = dp[i]

        elif num == 15:
            if dp[i][2] > 0:
                dp[i+1][2] = dp[i][2] - 1
                dp[i+1][3] = dp[i][3] + 1
                for j in range(1, 7):
                    if j != 2 and j != 3:
                        dp[i+1][j] = dp[i][j]
            else:
                dp[i+1] = dp[i]

        elif num == 16:
            if dp[i][3] > 0:
                dp[i+1][3] = dp[i][3] - 1
                dp[i+1][4] = dp[i][4] + 1
                for j in range(1, 7):
                    if j != 3 and j != 4:
                        dp[i+1][j] = dp[i][j]
            else:
                dp[i+1] = dp[i]

        elif num == 23:
            if dp[i][4] > 0:
                dp[i+1][4] = dp[i][4] - 1
                dp[i+1][5] = dp[i][5] + 1
                for j in range(1, 7):
                    if j != 4 and j != 5:
                        dp[i+1][j] = dp[i][j]
            else:
                dp[i+1] = dp[i]

        elif num == 42:
            if dp[i][5] > 0:
                dp[i+1][5] = dp[i][5] - 1
                dp[i+1][6] = dp[i][6] + 1
                for j in range(1, 7):
                    if j != 5 and j != 6:
                        dp[i+1][j] = dp[i][j]
            else:
                dp[i+1] = dp[i]
    print(ans - 6*dp[n][6])
    return


def main():
    test = 1
    for i in range(test):
        solution()
    return


if __name__ == "__main__":
    main()
