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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

public class c6 {

    public static void main(String args[]){

        PrintWriter out = new PrintWriter(System.out);
        Reader in = new Reader();
        int n = in.nextInt();
        int a[] = new int[n+1];
        int min = n;
        int dp4[] = new int[n+1];
        int dp8[] = new int[n+1];
        int dp15[] = new int[n+1];
        int dp16[] = new int[n+1];
        int dp23[] = new int[n+1];
        int dp42[] = new int[n+1];

        for(int i=1;i<=n;i++){
            a[i] = in.nextInt();

            if(a[i] == 4){

                dp4[i] = 1 + dp4[i-1];
                dp8[i] = dp8[i-1];
                dp15[i] = dp15[i-1];
                dp16[i] = dp16[i-1];
                dp23[i] = dp23[i-1];
                dp42[i] = dp42[i-1];


            }
            else if(a[i]==8){
                 dp8[i] = dp8[i-1] +  ((dp4[i-1]>dp8[i-1])?1:0);
                dp4[i] = dp4[i-1];

                dp15[i] = dp15[i-1];
                dp16[i] = dp16[i-1];
                dp23[i] = dp23[i-1];
                dp42[i] = dp42[i-1];


            }
            else if(a[i]==15){
                dp15[i] = dp15[i-1] +  ((dp8[i-1]>dp15[i-1])?1:0);
                dp4[i] = dp4[i-1];

                dp8[i] = dp8[i-1];
                dp16[i] = dp16[i-1];
                dp23[i] = dp23[i-1];
                dp42[i] = dp42[i-1];

            }
            else if(a[i]==16){
                dp16[i] = dp16[i-1] +  ((dp15[i-1]>dp16[i-1])?1:0);
                dp4[i] = dp4[i-1];

                dp15[i] = dp15[i-1];
                dp8[i] = dp8[i-1];
                dp23[i] = dp23[i-1];
                dp42[i] = dp42[i-1];

            }
            else if(a[i]==23){
                dp23[i] = dp23[i-1] +  ((dp16[i-1]>dp23[i-1])?1:0);
                dp4[i] = dp4[i-1];

                dp15[i] = dp15[i-1];
                dp16[i] = dp16[i-1];
                dp8[i] = dp8[i-1];
                dp42[i] = dp42[i-1];

            }
            else{
                dp42[i] = dp42[i-1] +  ((dp23[i-1]>dp42[i-1])?1:0);
                dp4[i] = dp4[i-1];

                dp15[i] = dp15[i-1];
                dp16[i] = dp16[i-1];
                dp23[i] = dp23[i-1];
                dp8[i] = dp8[i-1];

            }



        }

        out.println(n - 6*dp42[n]);
        out.flush();
        out.close();
    }
    static class Reader {

        private InputStream mIs;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public Reader() {
            this(System.in);
        }

        public Reader(InputStream is) {
            mIs = is;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();

            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = mIs.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public String nextLine() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }

    }

}
