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
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int modular_exponentiation(long long int base, long long int power) {
  long long int ans = 1;
  base = base % mod;
  while (power > 0) {
    if (power & 1) {
      ans = (ans * base) % mod;
    }
    power /= 2;
    base = (base * base) % mod;
  }
  return ans;
}
int main() {
  int t = 1;
  while (t--) {
    long long int n, i, j;
    cin >> n;
    long long int arr[n + 1];
    long long int dp[n + 1][6];
    for (i = 0; i <= n; i++) {
      for (j = 0; j < 6; j++) {
        dp[i][j] = 0;
      }
    }
    for (i = 1; i <= n; i++) {
      cin >> arr[i];
    }
    for (i = 1; i <= n; i++) {
      if (arr[i] == 4) {
        for (j = 0; j < 6; j++) {
          if (j == 0) {
            dp[i][j] = dp[i - 1][j] + 1;
          } else {
            dp[i][j] = dp[i - 1][j];
          }
        }
      } else if (arr[i] == 8) {
        for (j = 0; j < 6; j++) {
          if (j == 1) {
            dp[i][j] = dp[i - 1][j] + 1;
          } else {
            dp[i][j] = dp[i - 1][j];
          }
        }
      } else if (arr[i] == 15) {
        for (j = 0; j < 6; j++) {
          if (j == 2) {
            dp[i][j] = dp[i - 1][j] + 1;
          } else {
            dp[i][j] = dp[i - 1][j];
          }
        }
      } else if (arr[i] == 16) {
        for (j = 0; j < 6; j++) {
          if (j == 3) {
            dp[i][j] = dp[i - 1][j] + 1;
          } else {
            dp[i][j] = dp[i - 1][j];
          }
        }
      } else if (arr[i] == 23) {
        for (j = 0; j < 6; j++) {
          if (j == 4) {
            dp[i][j] = dp[i - 1][j] + 1;
          } else {
            dp[i][j] = dp[i - 1][j];
          }
        }
      } else {
        for (j = 0; j < 6; j++) {
          if (j == 5) {
            dp[i][j] = dp[i - 1][j] + 1;
          } else {
            dp[i][j] = dp[i - 1][j];
          }
        }
      }
    }
    long long int temp[6];
    for (j = 0; j < 6; j++) {
      temp[j] = 0;
    }
    long long int ans = 0;
    for (i = 1; i <= n; i++) {
      for (j = 0; j < 6; j++) {
        dp[i][j] -= temp[j];
      }
      for (j = 1; j < 6; j++) {
        if (dp[i][j] > dp[i][j - 1]) {
          ans++;
          dp[i][j] -= 1;
          temp[j] += 1;
        }
      }
    }
    long long int mini = 1000000;
    for (j = 0; j < 6; j++) {
      if (dp[n][j] < mini) {
        mini = dp[n][j];
      }
    }
    for (j = 0; j < 6; j++) {
      ans += abs(dp[n][j] - mini);
    }
    cout << ans << '\n';
  }
}
