#include <bits/stdc++.h>
using namespace std;
int dp[1010][(1 << 8)], ct[9];
bool vis[1010][(1 << 8)], ok;
int arr[1010], n, run, quan;
vector<int> numbers[9];
set<int> masks;
int solve(int ind, int mask) {
  if (mask == (1 << 8) - 1) return !(ok = true);
  if (ind == n) return -(1 << 30);
  masks.insert(mask);
  if (vis[ind][mask]) return dp[ind][mask];
  vis[ind][mask] = true;
  if ((mask >> arr[ind]) & 1) {
    return dp[ind][mask] = solve(ind + 1, mask);
  } else {
    int pos =
        lower_bound(numbers[arr[ind]].begin(), numbers[arr[ind]].end(), ind) -
        numbers[arr[ind]].begin();
    int next = solve(ind + 1, mask);
    int withr = -(1 << 30);
    int withr1 = -(1 << 30);
    assert(numbers[arr[ind]][pos] == ind);
    if (pos + run - 1 < numbers[arr[ind]].size())
      withr = run + solve(numbers[arr[ind]][pos + run - 1] + 1,
                          (mask | (1 << arr[ind])));
    if (pos + run < numbers[arr[ind]].size())
      withr1 =
          run + 1 +
          solve(numbers[arr[ind]][pos + run] + 1, (mask | (1 << arr[ind])));
    return dp[ind][mask] = max(next, max(withr, withr1));
  }
}
int main() {
  scanf("%d", &n);
  for (int e = 0; e < n; e++) scanf("%d", arr + e), arr[e]--;
  for (int e = 0; e < n; e++) numbers[arr[e]].push_back(e);
  int ans = 0;
  for (int e = 0; e < n; e++) ct[arr[e]] = 1;
  for (int e = 0; e < 9; e++) ans += ct[e];
  int lo = 1, hi = n / 8 + 4;
  while (lo <= hi) {
    run = (lo + hi) >> 1;
    memset(vis, 0, sizeof vis);
    int cur = solve(0, 0);
    if (cur > 0)
      ans = cur, lo = run + 1;
    else
      hi = run - 1;
  }
  printf("%d\n", ans);
  return 0;
}
