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
//package com.company;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Loseit {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int n = Integer.parseInt(br.readLine());
            if (n < 6) {
                System.out.println(n);
            } else {
                //ArrayList<Integer> a = new ArrayList();
                int a[] = new int[n];
                int x;
                int il42=-1;
                StringTokenizer st = new StringTokenizer(br.readLine());
                int p[] = new int[6];
                int g[] = {4,8,15,16,23,42};
                int c=a.length;
                int k=0;
                int i;
                boolean logic=true;
                for(int j=0;j<n;j++){
                    x = Integer.parseInt(st.nextToken());
                    a[j] = x;
                    if(x==24)
                        il42=j;
                }

                while(c>0 && logic){
                    i=0;
                    //k=0;
                    for(;i<6;i++){
                        for(;k<a.length;k++){
                            if(a[k]==g[i]){
                                p[i]=k;
                                if(i!=5)
                                    k=Math.max(p[i+1]-1,k);
                                break;
                            }
                        }
                        if(k==a.length) {
                            logic=false;
                            break;
                        }
                    }
                    if(i==6){
                        k=p[0]+1;
                        for(int o=0;o<6;o++){
                            a[p[o]]=-1;
                        }
                        c-=6;
                        if(p[5]==il42)
                            break;
                    }
                    else{
                        break;
                    }
                }
                System.out.println(c);
            }
        }
        catch (Exception e) {
            System.out.print(e);
        }


    }
}
