#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int n, l, r, mid, ans;
int a[N], sum[8], f[N][1 << 8];
vector<int> v[8];
inline int jay(int mid) {
  memset(f, 0, sizeof(f));
  for (register int i = 0; i < n; ++i)
    for (register int p = 0; p <= 255; ++p) {
      for (register int j = 0; j < 8; ++j)
        if (!((1 << j) & p)) {
          if (v[j][v[j].size() - mid] > i) {
            int pos = upper_bound(v[j].begin(), v[j].end(), i) - v[j].begin();
            f[v[j][pos + mid - 1]][p | (1 << j)] =
                max(f[v[j][pos + mid - 1]][p | (1 << j)], f[i][p] + mid);
            if (pos + mid < v[j].size())
              f[v[j][pos + mid]][p | (1 << j)] =
                  max(f[v[j][pos + mid]][p | (1 << j)], f[i][p] + mid + 1);
          }
        }
    }
  int maxn = 0;
  for (register int i = 1; i <= n; ++i)
    for (register int p = 0; p <= 255; ++p) maxn = max(maxn, f[i][p]);
  return maxn;
}
int main() {
  scanf("%d", &n);
  for (register int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]), a[i]--, sum[a[i]]++;
    v[a[i]].push_back(i);
  }
  sort(sum, sum + 8);
  l = 1;
  r = sum[0];
  if (!r) {
    for (register int i = 0; i < 8; ++i)
      if (sum[i]) ans++;
    printf("%d\n", ans);
    return 0;
  }
  while (l <= r) {
    mid = l + r >> 1;
    int now = jay(mid);
    if (now >= mid * 8)
      ans = now, l = mid + 1;
    else
      r = mid - 1;
  }
  printf("%d\n", ans);
  return 0;
}
