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.StringTokenizer;
import java.util.HashMap;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Washoum
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        inputClass in = new inputClass(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, inputClass sc, PrintWriter out) {
            int n = sc.nextInt();
            int[] tab = new int[n];
            for (int i = 0; i < n; i++) {
                tab[i] = sc.nextInt();
            }
            ArrayList<ArrayList<Integer>> seq = new ArrayList<>();
            HashMap<Integer, ArrayList<Integer>> map = new HashMap<>();
            int[] p = {4, 8, 15, 16, 23, 42};
            for (int i = 0; i < 6; i++) {
                map.put(p[i], new ArrayList<>());
            }
            int where;
            ArrayList<Integer> tmp;
            for (int i = 0; i < n; i++) {
                if (tab[i] == 4) {
                    seq.add(new ArrayList<>());
                    seq.get(seq.size() - 1).add(4);
                    map.get(4).add(seq.size() - 1);

                } else if (tab[i] == 8) {
                    tmp = map.get(4);
                    if (tmp.size() > 0) {
                        where = tmp.get(tmp.size() - 1);
                        seq.get(where).add(8);
                        map.get(8).add(where);
                        tmp.remove(tmp.size() - 1);
                    }
                } else if (tab[i] == 15) {
                    tmp = map.get(8);
                    if (tmp.size() > 0) {
                        where = tmp.get(tmp.size() - 1);
                        seq.get(where).add(15);
                        map.get(15).add(where);
                        tmp.remove(tmp.size() - 1);
                    }
                } else if (tab[i] == 16) {
                    tmp = map.get(15);
                    if (tmp.size() > 0) {
                        where = tmp.get(tmp.size() - 1);
                        seq.get(where).add(16);
                        map.get(16).add(where);
                        tmp.remove(tmp.size() - 1);
                    }
                } else if (tab[i] == 23) {
                    tmp = map.get(16);
                    if (tmp.size() > 0) {
                        where = tmp.get(tmp.size() - 1);
                        seq.get(where).add(23);
                        map.get(23).add(where);
                        tmp.remove(tmp.size() - 1);
                    }
                } else if (tab[i] == 42) {
                    tmp = map.get(23);
                    if (tmp.size() > 0) {
                        where = tmp.get(tmp.size() - 1);
                        seq.get(where).add(42);
                        map.get(42).add(where);
                        tmp.remove(tmp.size() - 1);
                    }
                }
            }
            int ans = n;
            for (int i = 0; i < seq.size(); i++) {
                if (seq.get(i).size() == 6) {
                    ans -= 6;
                }
            }
            out.println(ans);
        }

    }

    static class inputClass {
        BufferedReader br;
        StringTokenizer st;

        public inputClass(InputStream in) {

            br = new BufferedReader(new InputStreamReader(in));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

