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;
inline int read() {
  char c = getchar();
  int p = 1, ret = 0;
  while ((c < '0') || (c > '9')) {
    if (c == '-') p = -1;
    c = getchar();
  }
  while ((c >= '0') && (c <= '9'))
    ret = (ret << 1) + (ret << 3) + c - '0', c = getchar();
  return ret * p;
}
int n, L, R;
int sum[1005][8];
bool dp[1005][256][8];
struct state {
  int k, s, r;
} q[2500000];
int a[1005];
inline int find(int x, int k) {
  int l = -1, r = n + 1;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (sum[mid][x] >= k)
      r = mid;
    else
      l = mid;
  }
  return r;
}
inline void ins(int x, int y, int z) {
  if (dp[x][y][z]) return;
  dp[x][y][z] = true;
  q[++R] = (state){x, y, z};
}
inline bool check(int p) {
  int r = p % 8, x = p / 8;
  memset(dp, 0, sizeof(dp));
  L = 0;
  R = 1;
  ins(0, 255, r);
  while (R >= L) {
    state t = q[L++];
    for (int i = 0; i < 8; i++)
      if ((1 << i) & t.s) {
        int tmp = find(i, sum[t.k][i] + x);
        if (tmp < t.k) tmp = t.k;
        if (tmp <= n) ins(tmp, t.s ^ (1 << i), t.r);
        if (t.r > 0) {
          tmp = find(i, sum[t.k][i] + x + 1);
          if (tmp <= n) ins(tmp, t.s ^ (1 << i), t.r - 1);
        }
      }
  }
  for (int i = 1; i <= n; i++)
    if (dp[i][0][0]) return true;
  return false;
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read() - 1;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < 8; j++)
      if (a[i] != j)
        sum[i][j] = sum[i - 1][j];
      else
        sum[i][j] = sum[i - 1][j] + 1;
  int l = 1, r = n + 1;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (check(mid))
      l = mid;
    else
      r = mid;
  }
  printf("%d", l);
}
