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.*;

public class LoseIt565 {
    public static void main(String[] args) {
        Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        List<Integer> list4 = new LinkedList<>();
        List<Integer> list8 = new LinkedList<>();
        List<Integer> list15 = new LinkedList<>();
        List<Integer> list16 = new LinkedList<>();
        List<Integer> list23 = new LinkedList<>();
        List<Integer> list42 = new LinkedList<>();

        int n = in.nextInt();
        for (int i = 0; i < n; i++) {
            switch (in.nextInt()) {
                case 4:
                    list4.add(i);
                    break;
                case 8:
                    list8.add(i);
                    break;
                case 15:
                    list15.add(i);
                    break;
                case 16:
                    list16.add(i);
                    break;
                case 23:
                    list23.add(i);
                    break;
                case 42:
                    list42.add(i);
                    break;
            }
        }
        int del = 0;

        Integer ind;
        while (!list4.isEmpty() && !list8.isEmpty() && !list15.isEmpty() && !list16.isEmpty() && !list23.isEmpty() && !list42.isEmpty()) {
            ind = list4.get(0);
            while (!list8.isEmpty() && list8.get(0) < ind) {
                list8.remove(0);
                del++;
            }
            if (list8.isEmpty()) {
                break;
            }
            ind = list8.get(0);
            while (!list15.isEmpty() && list15.get(0) < ind) {
                list15.remove(0);
                del++;
            }
            if (list15.isEmpty()) {
                break;
            }
            ind = list15.get(0);
            while (!list16.isEmpty() && list16.get(0) < ind) {
                list16.remove(0);
                del++;
            }
            if (list16.isEmpty()) {
                break;
            }
            ind = list16.get(0);
            while (!list23.isEmpty() && list23.get(0) < ind) {
                list23.remove(0);
                del++;
            }
            if (list23.isEmpty()) {
                break;
            }
            ind = list23.get(0);
            while (!list42.isEmpty() && list42.get(0) < ind) {
                list42.remove(0);
                del++;
            }
            if (list42.isEmpty()) {
                break;
            }
            ind = list42.get(0);
            list4.remove(0);
            list8.remove(0);
            list15.remove(0);
            list16.remove(0);
            list23.remove(0);
            list42.remove(0);
        }
        del += list4.size();
        del += list8.size();
        del += list15.size();
        del += list16.size();
        del += list23.size();
        del += list42.size();
        System.out.println(del);

    }
}
