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.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeSet;

/**
 * Created by himanshubhardwaj on 09/06/19.
 */
public class C {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());

        String[] str = br.readLine().split(" ");

        HashMap<Integer, TreeSet<Element>> map = new HashMap<>();
        map.put(4, new TreeSet<>());
        map.put(8, new TreeSet<>());
        map.put(15, new TreeSet<>());
        map.put(16, new TreeSet<>());
        map.put(23, new TreeSet<>());
        map.put(42, new TreeSet<>());


        for (int i = 0; i < str.length; i++) {
            int element = Integer.parseInt(str[i]);
            map.get(element).add(new Element(i));
        }


        TreeSet<Element> tempFourPos = (TreeSet<Element>) map.get(4).clone();
        for (Element fourPos : tempFourPos) {
            Element eightPos = map.get(8).ceiling(fourPos);
            if (eightPos == null) {
                break;
            }

            Element fifteenPos = map.get(15).ceiling(eightPos);
            if (fifteenPos == null) {
                break;
            }


            Element sixteenPos = map.get(16).ceiling(fifteenPos);
            if (sixteenPos == null) {
                break;
            }


            Element twentyThreePos = map.get(23).ceiling(sixteenPos);
            if (twentyThreePos == null) {
                break;
            }

            Element fourtyTwoPos = map.get(42).ceiling(twentyThreePos);
            if (fourtyTwoPos == null) {
                break;
            }

            map.get(4).remove(fourPos);
            map.get(8).remove(eightPos);
            map.get(15).remove(fifteenPos);
            map.get(16).remove(sixteenPos);
            map.get(23).remove(twentyThreePos);
            map.get(42).remove(fourtyTwoPos);
        }

        int count = 0;
        for (Map.Entry<Integer, TreeSet<Element>> entry : map.entrySet()) {
            count += entry.getValue().size();
        }

        System.out.println(count);


    }
}


class Element implements Comparable<Element> {
    int index;

    @java.beans.ConstructorProperties({"index"})
    public Element(int index) {
        this.index = index;
    }

    @Override
    public int compareTo(Element o) {
        return this.index - o.index;
    }
}
