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 M = 1005;
int read() {
  int x = 0, f = 1;
  char c;
  while ((c = getchar()) < '0' || c > '9') {
    if (c == '-') f = -1;
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
int n, ans, a[M], num[10], dp[M][1 << 8];
vector<int> pos[10];
int check(int x) {
  memset(num, 0, sizeof num);
  memset(dp, -1, sizeof dp);
  dp[0][0] = 0;
  int res = -1;
  for (int i = 0; i < n; i++) {
    if (i) num[a[i]]++;
    for (int j = 0; j < (1 << 8); j++) {
      if (dp[i][j] == -1) continue;
      for (int k = 1; k <= 8; k++) {
        if (j & (1 << k - 1)) continue;
        int t = num[k] + x - 1;
        if (t < pos[k].size())
          dp[pos[k][t]][j | (1 << k - 1)] =
              max(dp[pos[k][t]][j | (1 << k - 1)], dp[i][j]);
        if (++t < pos[k].size())
          dp[pos[k][t]][j | (1 << k - 1)] =
              max(dp[pos[k][t]][j | (1 << k - 1)], dp[i][j] + 1);
      }
    }
  }
  for (int i = 1; i <= n; i++) res = max(res, dp[i][(1 << 8) - 1]);
  if (res == -1) return 0;
  ans = max(ans, 8 * x + res);
  return 1;
}
void dich(int l, int r) {
  if (l > r) return;
  int mid = (l + r) >> 1;
  if (check(mid))
    dich(mid + 1, r);
  else
    dich(l, mid - 1);
}
signed main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    pos[a[i]].push_back(i);
  }
  for (int i = 1; i <= 8; i++)
    if (pos[i].size() == 0) {
      for (int j = 1; j <= 8; j++)
        if (pos[j].size()) ans++;
      printf("%d\n", ans);
      return 0;
    }
  dich(1, n);
  printf("%d\n", ans);
}
