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.util.*;
public class lose {
    public static void main(String[] args) {
        Scanner iangay = new Scanner(System.in);
        int l = iangay.nextInt(), remove = 0;
        HashMap<Integer, Integer> c = new HashMap<>();
        int[] nums = {4, 8, 15, 16, 23, 42};
        for (int n : nums) { c.put(n, 0); }
        int[] a = new int[l];
        for (int i = 0; i < l; i++) {
            a[i] = iangay.nextInt();
            c.put(a[i], c.get(a[i]) + 1);
            int index = Arrays.binarySearch(nums, a[i]);
            boolean good = true;
            for (int j = 0; j < index; j++) {
                if (c.get(nums[j]) < c.get(a[i])) { good = false; break; }
            }
//            for (int n : nums) {
//                System.out.print("(" + n + ", " + c.get(n) + ") ");
//            }
//            System.out.println();
            if (!good) {
                remove++;
                c.put(a[i], c.get(a[i]) - 1);
//                System.out.println(i);
            }
        }
        int min = Collections.min(c.values());
        for (int n : nums) { remove += c.get(n) - min; }
        if (l < 6) { System.out.println(l); }
        else { System.out.println(remove); }
    }
}