#include <bits/stdc++.h>
using namespace std;
int IN() {
  int c, f, x;
  while (!isdigit(c = getchar()) && c != '-')
    ;
  c == '-' ? (f = 1, x = 0) : (f = 0, x = c - '0');
  while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0';
  return !f ? x : -x;
}
const int N = 1000 + 19;
int A[N], f[1 << 8][N], sum[8][N];
int n, mx;
void Work(int s) {
  memset(f, 200, sizeof(f));
  for (int i = 0; i < n + 1; i++) f[0][i] = 0;
  for (int t = 0; t < 1 << 8; t++) {
    for (int j = 0; j < 8; j++)
      if (t >> j & 1) {
        int k1 = 0, k2 = 0;
        for (int i = 1; i < n + 1; i++) {
          while (k1 < i && sum[j][i] - sum[j][k1 + 1] >= s) k1++;
          while (k2 < i && sum[j][i] - sum[j][k2 + 1] >= s + 1) k2++;
          if (sum[j][i] - sum[j][k1] >= s) {
            f[t][i] = max(f[t][i], f[t ^ (1 << j)][k1] + s);
          }
          if (sum[j][i] - sum[j][k2] >= s + 1) {
            f[t][i] = max(f[t][i], f[t ^ (1 << j)][k2] + s + 1);
          }
        }
      }
  }
  if (s == 0) {
    for (int t = 0; t < 1 << 8; t++) mx = max(mx, f[t][n]);
  } else {
    mx = max(mx, f[(1 << 8) - 1][n]);
  }
}
int main() {
  n = IN();
  for (int i = 1; i < n + 1; i++) A[i] = IN() - 1;
  for (int i = 0; i < 8; i++) {
    for (int j = 1; j < n + 1; j++) sum[i][j] = sum[i][j - 1] + (A[j] == i);
  }
  for (int t = 0; 8 * t <= n; t++) Work(t);
  printf("%d\n", mx);
}
