Vladik was bored on his way home and decided to play the following game. He took n cards and put them in a row in front of himself. Every card has a positive integer number not exceeding 8 written on it. He decided to find the longest subsequence of cards which satisfies the following conditions:

  * the number of occurrences of each number from 1 to 8 in the subsequence doesn't differ by more then 1 from the number of occurrences of any other number. Formally, if there are ck cards with number k on them in the subsequence, than for all pairs of integers <image> the condition |ci - cj| ≤ 1 must hold. 
  * if there is at least one card with number x on it in the subsequence, then all cards with number x in this subsequence must form a continuous segment in it (but not necessarily a continuous segment in the original sequence). For example, the subsequence [1, 1, 2, 2] satisfies this condition while the subsequence [1, 2, 2, 1] doesn't. Note that [1, 1, 2, 2] doesn't satisfy the first condition. 



Please help Vladik to find the length of the longest subsequence that satisfies both conditions.

Input

The first line contains single integer n (1 ≤ n ≤ 1000) — the number of cards in Vladik's sequence.

The second line contains the sequence of n positive integers not exceeding 8 — the description of Vladik's sequence.

Output

Print single integer — the length of the longest subsequence of Vladik's sequence that satisfies both conditions.

Examples

Input

3
1 1 1


Output

1

Input

8
8 7 6 5 4 3 2 1


Output

8

Input

24
1 8 1 2 8 2 3 8 3 4 8 4 5 8 5 6 8 6 7 8 7 8 8 8


Output

17

Note

In the first sample all the numbers written on the cards are equal, so you can't take more than one card, otherwise you'll violate the first condition.
#include <bits/stdc++.h>
using namespace std;
const int inf = int(1e9);
const double eps = 0.0000000001, pi = 3.14159265358979323;
const int maxn = 1111;
int a[maxn], dp[maxn][(1 << 8) + 100], cur[10], n;
vector<int> insert[10];
int can(int len) {
  for (int i = 0; i <= 8; i++) cur[i] = 0;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j < (1 << 8); j++) dp[i][j] = -inf;
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < (1 << 8); j++) {
      if (dp[i][j] == -inf) continue;
      for (int k = 1; k <= 8; k++) {
        if (j & (1 << k - 1)) continue;
        int it = cur[k] + len - 1;
        if (it >= int(insert[k].size())) continue;
        dp[insert[k][it] + 1][j | (1 << k - 1)] =
            max(dp[insert[k][it] + 1][j | (1 << k - 1)], dp[i][j]);
        it++;
        if (it >= int(insert[k].size())) continue;
        dp[insert[k][it] + 1][j | (1 << k - 1)] =
            max(dp[insert[k][it] + 1][j | (1 << k - 1)], dp[i][j] + 1);
      }
    }
    cur[a[i]]++;
  }
  int ans = -inf;
  for (int i = 0; i <= n; i++) ans = max(ans, dp[i][(1 << 8) - 1]);
  if (ans == -inf) return -1;
  return ans * (len + 1) + (8 - ans) * len;
}
int main() {
  int ans;
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; i++) insert[a[i]].push_back(i);
  if (n < 8) {
    ans = 0;
    for (int i = 1; i <= 8; ++i)
      if (!insert[i].empty()) ++ans;
    cout << ans;
    return 0;
  }
  int l = 1, r = n / 8;
  while (r - l > 1) {
    int m = (l + r) >> 1;
    if (can(m) != -1)
      l = m;
    else
      r = m;
  }
  ans = max(can(l), can(r));
  if (ans == -1) {
    ans = 0;
    for (int i = 1; i <= 8; i++)
      if (!insert[i].empty()) ans++;
  }
  cout << ans << endl;
  return 0;
}
