#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;
}
