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;
int read() {
  char ch = getchar();
  int res = 0, f = 1;
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') f = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) res = res * 10 + (ch - '0');
  return res * f;
}
const int MAXN = (1 << 8) - 1;
int n, a[1005], t[9], pos[9][1005], r = 1 << 15, l;
int start[9], f[1005][MAXN + 5], ans;
inline int maxx(int x, int y) { return x > y ? x : y; }
bool check(int x) {
  for (int i = 1; i <= 8; ++i) start[i] = 1;
  memset(f, 250, sizeof(f));
  f[0][0] = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < MAXN; ++j)
      if (f[i][j] >= 0)
        for (int k = 1; k <= 8; ++k) {
          if (j & (1 << (k - 1))) continue;
          int u = start[k] + x - 1, g = j | (1 << (k - 1));
          if (u <= t[k]) f[pos[k][u]][g] = maxx(f[pos[k][u]][g], f[i][j]);
          if (++u <= t[k]) f[pos[k][u]][g] = maxx(f[pos[k][u]][g], f[i][j] + 1);
        }
    ++start[a[i]];
  }
  int add = -1;
  for (int i = 8; i <= n; ++i) add = maxx(add, f[i][MAXN]);
  if (add == -1) return 0;
  ans = maxx(ans, 8 * x + add);
  return 1;
}
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) {
    a[i] = read();
    pos[a[i]][++t[a[i]]] = i;
  }
  for (int i = 1; i <= 8; ++i) r = min(r, t[i]);
  if (r == 0) {
    int res = 0;
    for (int i = 1; i <= 8; ++i)
      if (t[i]) res++;
    cout << res;
    return 0;
  }
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (check(mid))
      l = mid + 1;
    else
      r = mid - 1;
  }
  printf("%d", ans);
  return 0;
}
