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;
template <class T>
inline T bigmod(T b, T p, T M) {
  long long ret = 1;
  for (; p > 0; p >>= 1) {
    if (p & 1) ret = (ret * b) % M;
    b = (b * b) % M;
  }
  return (T)ret;
}
template <class T>
inline T __lcm(T a, T b) {
  return (a * b) / __gcd(a, b);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
struct z {
  int u, v, w;
  z() {}
  z(int _u, int _v, int _w) { u = _u, v = _v, w = _w; }
  bool friend operator<(z a, z b) { return a.w < b.w; }
};
const double PI = acos(-1.0), EPS = 1e-7;
const long long INF = 1e18;
const int N = 1005, M = 1e9 + 7, NIL = -1;
int n, dp[N][1 << 9], a[N], sum[N][N];
int fun(int pos, int lim, int val) {
  int lo = pos, hi = n, best = -1;
  while (lo <= hi) {
    int mid = (lo + hi) / 2;
    if (sum[mid][val] - sum[pos - 1][val] >= lim) {
      best = mid;
      hi = mid - 1;
    } else
      lo = mid + 1;
  }
  return best;
}
int go(int pos, int mask, int lim) {
  if (mask == 255) return 0;
  if (pos > n) return -M;
  int &ret = dp[pos][mask];
  if (ret != -1) return ret;
  ret = -M;
  for (int i = 0; i < 8; i++) {
    if (mask & (1 << i)) continue;
    int idx = fun(pos, lim, i);
    if (idx != -1) ret = max(ret, lim + go(idx + 1, mask | (1 << i), lim));
    if (lim > 1) {
      idx = fun(pos, lim - 1, i);
      if (idx != -1)
        ret = max(ret, lim - 1 + go(idx + 1, mask | (1 << i), lim));
    } else
      ret = max(ret, go(pos, mask | (1 << i), lim));
  }
  return ret;
}
int main() {
  cin >> n;
  for (int i = 1; i < n + 1; i++) {
    cin >> a[i];
    a[i]--;
    for (int j = 0; j < 8; j++) {
      sum[i][j] = sum[i - 1][j];
    }
    sum[i][a[i]]++;
  }
  int ans = 0;
  for (int i = 1; i < 126; i++) {
    memset(dp, -1, sizeof dp);
    ans = max(ans, go(1, 0, i));
  }
  cout << ans << endl;
  return 0;
}
