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 = 0x3fffffff;
const long long mod = 1000000007;
const int maxn = 1000 + 100;
int a[maxn];
vector<int> nex[10];
int d[maxn][(1 << 8) + 100];
int ans;
int n;
int ne[maxn][maxn];
int solve(int l) {
  for (int i = 0; i <= n; i++)
    for (int j = 0; j < (1 << 8); j++) d[i][j] = -inf;
  d[0][0] = 0;
  int res = -inf;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < (1 << 8); j++) {
      d[i][j] = max(d[i][j], d[i - 1][j]);
      if (j & (1 << a[i])) continue;
      if (ne[i][l] != -1)
        d[ne[i][l]][j | (1 << a[i])] =
            max(d[ne[i][l]][j | (1 << a[i])], d[i - 1][j]);
      if (ne[i][l + 1] != -1)
        d[ne[i][l + 1]][j | (1 << a[i])] =
            max(d[ne[i][l + 1]][j | (1 << a[i])], d[i - 1][j] + 1);
    }
  }
  if (!l) {
    for (int i = 1; i <= n; i++)
      for (int j = 0; j < (1 << 8); j++) res = max(res, d[i][j]);
  } else {
    for (int i = 1; i <= n; i++) res = max(res, d[i][(1 << 8) - 1]);
  }
  if (res < 0) return -1;
  return res * (l + 1) + (8 - res) * l;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n + 1; i++) {
    scanf("%d", &a[i]);
    a[i]--;
    nex[a[i]].push_back(i);
  }
  memset(ne, -1, sizeof(ne));
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < nex[i].size(); j++) {
      for (int k = j; k < nex[i].size(); k++) {
        ne[nex[i][j]][k - j + 1] = nex[i][k];
      }
    }
  }
  int l = 0, r = n / 8 + 1;
  ans = -1;
  while (l <= r) {
    int m = (l + r) / 2;
    int t = solve(m);
    if (t != -1) {
      ans = max(ans, t);
      l = m + 1;
    } else
      r = m - 1;
  }
  printf("%d\n", ans);
  return 0;
}
