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.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

/**
 * Created by edwardim on 8/12/19.
 */
public class Main {
    // Outputs number of steps to get to 1, otherwise returns -1
    public static long divide(long n) {
        int numFives = 0;
        int numThrees = 0;
        int numTwos = 0;
        while (n % 5 == 0 && n > 1) {
            n = n / 5;
            numFives++;
        }
        while (n % 3 == 0 && n > 1) {
            n = n / 3;
            numThrees++;
        }
        while (n % 2 == 0 && n > 1) {
            n = n / 2;
            numTwos++;
        }
        if (n != 1) {
            return -1;
        }
        else {
            return numTwos + (2 * numThrees) + (3 * numFives);
        }
    }

    public static int merge(int[] numbers, int length) {
        int numZeros = 0;
        int numOnes = 0;
        int numTwos = 0;
        for (int i = 0; i < length; i += 1) {
            int elem = numbers[i];
            if (elem % 3 == 0) {
                numZeros++;
            } else if (elem % 3 == 1) {
                numOnes++;
            } else {
                numTwos++;
            }
        }
        if (numTwos < numOnes) {
            return numZeros + numTwos + ((numOnes - numTwos) / 3);
        } else {
            return numZeros + numOnes + ((numTwos - numOnes) / 3);
        }
    }

    public static int destroy(int[] arr, int length) {
        int numFour = 0;
        int numEight = 0;
        int numFifteen = 0;
        int numSixteen = 0;
        int numTwentyThree = 0;
        int numFortyTwo = 0;
        for (int i = 0; i < length; i += 1) {
            int num = arr[i];
            switch (num) {
                case 4:
                    numFour++;
                    break;
                case 8:
                    if (numFour > 0) {
                        numEight++;
                        numFour--;
                    }
                    break;
                case 15:
                    if (numEight > 0) {
                        numFifteen++;
                        numEight--;
                    }
                    break;
                case 16:
                    if (numFifteen > 0) {
                        numSixteen++;
                        numFifteen--;
                    }
                    break;
                case 23:
                    if (numSixteen > 0) {
                        numTwentyThree++;
                        numSixteen--;
                    }
                    break;
                case 42:
                    if (numTwentyThree > 0) {
                        numFortyTwo++;
                        numTwentyThree--;
                    }
                    break;
                default:
                    break;
            }
        }
        return length - (numFortyTwo * 6);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner();
        int len = sc.nextInt();
        int[] arr = new int[len];
        for (int j = 0; j < len; j++) {
            arr[j] = sc.nextInt();
        }
        System.out.println(destroy(arr, len));

    }
    static class Scanner

    {
        BufferedReader buf;
        StringTokenizer tok;

        Scanner() {
            buf = new BufferedReader(new InputStreamReader(System.in));
        }


        boolean hasNext() {
            while (tok == null || !tok.hasMoreElements()) {
                try {
                    tok = new StringTokenizer(buf.readLine());
                } catch (Exception e) {
                    return false;

                }

            }

            return true;

        }


        String next()

        {

            if (hasNext()) return tok.nextToken();

            return null;

        }


        int nextInt()

        {

            return Integer.parseInt(next());

        }


        long nextLong()

        {

            return Long.parseLong(next());

        }


        double nextDouble()

        {
            return Double.parseDouble(next());
        }
    }
}
