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.*;
import java.io.*;
public class Main{
    public static void main(String[] args) {
      int n=0;
      Scanner s = new Scanner(System.in);
      n=s.nextInt();
      int A[]= new int[n];
      long count4=0;
      long count8=0;
      long count15=0;
      long count16=0;long count23=0;long count42=0;
      int flag=0;
      int count=0;
      for(int i=0;i<n;i++){
        A[i]=s.nextInt();
        if(A[i]==4){
          count4++;
          continue;
        }
        if(A[i]==8){
          if(count4-count8>0){
            count8++;
            continue;
          }
          else{
            count++;
          }
        }
        if(A[i]==15){
          if(count8-count15>0){
            count15++;
            continue;
          }
          else{
            count++;
          }   
        }
        if(A[i]==16){
        if(count15-count16>0){
            count16++;
            continue;
          }
          else{
            count++;
          }
        }
        if(A[i]==23){
        if(count16-count23>0){
            count23++;
            continue;
          }
          else{
            count++;
          }
        }
        if(A[i]==42){
        if(count23-count42>0){
            count8--;count4--;count15--;count16--;count23--;
            continue;
          }
          else{
            count++;
          }
        }
      }
      System.out.println((count4+count8+count15+count16+count23+count42+count));
            
}
}

