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.io.PrintWriter;
import java.util.*;
public class A {

    public static void solve(){
        int n = nextInt();
        int[] seq = {4,8,15,16,23,42};
        int[] a = readIntArray(n);
        int[] dp = new int[6];
        use(map);
        for (int i = 0; i < 6; ++i){
            mapII.put(seq[i], i);
        }
        for (int i = 0; i < n; ++i){
            a[i] = mapII.get(a[i]);
        }
        for (int x : a){
            if (x == 0){
                dp[x]++;
                continue;
            }
            if (dp[x-1] > 0){
                dp[x]++;
                --dp[x-1];
            }
        }
        System.out.println(n-6*dp[5]);
    }
    public static void main(String[] args){
        solve();
    }













    public static int INT_MAX = Integer.MAX_VALUE;
    public static int INT_MIN = -INT_MAX+1;
    public static Map<Integer, Integer> mapII = new HashMap<>();
    public static ArrayList<Integer> intArrayList = new ArrayList();
    public static Stack<Integer> stackI = new Stack();
    public static String map = "mp";
    public static String arrayList = "al";
    public static String stack = "st";
    //public static PrintWriter p = new PrintWriter(System.out);
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer st=new StringTokenizer("");
    public static String next() {
        while (!st.hasMoreTokens())
            try {
                st=new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        return st.nextToken();
    }

    public static int nextInt() {
        return Integer.parseInt(next());
    }
    static long nextLong() {
        return Long.parseLong(next());
    }
    public static int[] readIntArray(int len){
        int[] a = new int[len];
        for (int i = 0; i < len; ++i){
            a[i] = nextInt();
        }
        return a;
    }
    public static long[] readLongArray(int len){
        long[] a = new long[len];
        for (int i = 0; i < len; ++i){
            a[i] = nextInt();
        }
        return a;
    }
    public static void sort(int[] nums){
        for (int i = nums.length/2; i >= 0; --i){
            sink(nums, i, nums.length);
        }
        for (int j = nums.length-1; j >= 0; --j){
            int temp = nums[j];
            nums[j] = nums[0];
            nums[0] = temp;
            sink(nums, 0, j);
        }
    }
    private static void sink(int[] nums, int i, int constraintLength){
        while (true){
            int left = 2*i+1;
            int right = 2*i+2;
            int largest = left;
            if (largest >= constraintLength) break;
            if (right < constraintLength && nums[right] > nums[left]){
                largest = right;
            }
            if (nums[largest] > nums[i]){
                int temp = nums[i];
                nums[i] = nums[largest];
                nums[largest] = temp;
                i = largest;
            }else break;
        }
    }
    public static void use(String id){
         if (id == arrayList){
             intArrayList.removeAll(intArrayList);
         }else if (id == map){
             mapII.clear();
         }else{
             stackI.clear();
         }
    }
    public static int min(int a, int b){
        return Math.min(a, b);
    }
    public static int max(int a, int b){
        return Math.max(a, b);
    }
    public static double max(double a, double b){
          return Math.max(a, b);
    }
    public static double min(double a, double b){
           return Math.min(a, b);
    }
    public static long max(long a,  long b){
        return Math.max(a, b);
    }
    public static long min(long a, long b){
        return Math.min(a, b);
    }
}

