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
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Abhijeetkns
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CLoseIt solver = new CLoseIt();
        solver.solve(1, in, out);
        out.close();
    }

    static class CLoseIt {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int arr[] = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = in.nextInt();
            }
            int no[] = new int[6];
            if (n < 6) out.println(n);
            else {
                int del = 0;
                for (int i = 0; i < n; i++) {
                    if (arr[i] == 4) {
                        no[0]++;
                    }
                    if (arr[i] == 8) {
                        if (no[1] < no[0])
                            no[1]++;
                        else del++;
                    }
                    if (arr[i] == 15) {
                        if (no[2] < no[1])
                            no[2]++;
                        else del++;
                    }
                    if (arr[i] == 16) {
                        if (no[3] < no[2])
                            no[3]++;
                        else del++;
                    }
                    if (arr[i] == 23) {
                        if (no[4] < no[3])
                            no[4]++;
                        else del++;
                    }
                    if (arr[i] == 42) {
                        if (no[5] < no[4])
                            no[5]++;
                        else del++;
                    }

                }
                Arrays.sort(no);
                int min = no[0];
                if (min == 0)
                    out.println(n);
                else {
                    for (int j = 5; j >= 0; j--) {
                        if (no[j] != min) {
                            del += (no[j] - min);
                        }
                    }

                    out.println(del);
                }
            }
        }

    }
}

