646. Lose it

0

Easy

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).Input Format

First line contains an integer N (size of the array) .

Second line contains an integer array of size N .

Second line contains an integer array of size N .

Output Format

Print the minimum number of elements to remove to make this array good.

Example

Input

15
4 8 4 8 15 16 8 16 23 15 16 4 42 23 42

Output

3

Constraints

1 <= n<= 10

A[i] consists of { 4,8,15,16,23,42 }

^{5}A[i] consists of { 4,8,15,16,23,42 }

Loading...

View Submissions

Console