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 C{
   public static void main(String[] args) throws IOException{
      BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
      int n = Integer.parseInt(f.readLine());
      int[] arr = new int[n];
      if(n < 6){
         System.out.println(n);
         System.exit(0);
      }
      StringTokenizer st = new StringTokenizer(f.readLine());
      for(int i = 0; i < n; i++){
         arr[i] = Integer.parseInt(st.nextToken());
      }
      int one = 0;
      int two = 0; 
      int three = 0;
      int four = 0;
      int five = 0;
      int six = 0;
      int subseq = 0;
      while(one < n && two < n && three < n && four < n && five < n && six < n){
         while(one < n && arr[one] != 4) one++;
         if(one == n) break;
         two = Math.max(two, one+1);
         while(two < n && arr[two] != 8) two++;
         if(two == n) break;
         three = Math.max(three, two+1);
         while(three < n && arr[three] != 15) three++;
         if(three == n) break;
         four = Math.max(four, three+1);
         while(four < n && arr[four] != 16) four++;
         if(four == n) break;
         five = Math.max(five, four+1);
         while(five < n && arr[five] != 23) five++;
         if(five == n) break;
         six = Math.max(six, five+1);
         while(six < n && arr[six] != 42) six++;
         if(six == n) break;
         subseq++;
         one++;
         two++;
         three++;
         four++;
         five++;
         six++;
      }
      System.out.println(n - (6*subseq));
   }
}