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 javax.print.DocFlavor;
import java.awt.*;
import java.io.*;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;

public class Main {

    static class pair {
        int x, y;

        pair(int x, int y) {
            this.x = x;
            this.y = y;
        }



    }


    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        PrintWriter out = new PrintWriter(System.out);

            int n = Integer.parseInt(br.readLine());
            ArrayList<Integer> z = new ArrayList<>();
            st = new StringTokenizer(br.readLine());
            int n4, n8, n15, n16, n23, n42;
            n4 = n8 = n15 = n16 = n23 = n42 = 0;
            for (int j = 0; j < n; j++) {
                int x = Integer.parseInt(st.nextToken());
                z.add(x);
                if (x == 4)
                    n4++;
                if (x == 8 && n4 > n8)
                    n8++;
                if (x == 15 && n8 > n15) {
                    n15++;
                }
                if (x == 16 && n15 > n16)
                    n16++;
                if (x == 23 && n16 > n23)
                    n23++;
                if (x == 42 && n23 > n42)
                    n42++;


            }
            int s=n42*6;
            out.println(n-s);


        out.flush();
    }
}
