#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
const int maxv = 8;
const int INF = 1000000000;
vector<int> in[maxv];
int dp[maxn][1 << maxv], cur[maxn], A[maxn];
void getIn(int n) {
  for (int i = 0; i < maxv; i++) in[i].clear();
  for (int i = 0; i < n; i++) in[A[i]].push_back(i);
}
char ss[10];
void getSS(int j) {
  for (int i = 0; i < 8; i++) {
    if (j & (1 << i))
      ss[7 - i] = '1';
    else
      ss[7 - i] = '0';
  }
}
int solve(int n, int len) {
  memset(cur, 0, sizeof(cur));
  for (int i = 0; i <= n; i++)
    for (int j = 0; j < (1 << maxv); j++) dp[i][j] = -INF;
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < (1 << maxv); j++) {
      if (dp[i][j] == -INF) continue;
      dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
      if (j & (1 << A[i])) continue;
      int it = cur[A[i]] + len - 1;
      if (it < in[A[i]].size())
        dp[in[A[i]][it] + 1][j | (1 << A[i])] =
            max(dp[in[A[i]][it] + 1][j | (1 << A[i])], dp[i][j]);
      it++;
      if (it < in[A[i]].size()) {
        dp[in[A[i]][it] + 1][j | (1 << A[i])] =
            max(dp[in[A[i]][it] + 1][j | (1 << A[i])], dp[i][j] + 1);
      }
    }
    cur[A[i]]++;
  }
  int ans = -INF;
  for (int i = 0; i <= n; i++) ans = max(ans, dp[i][(1 << maxv) - 1]);
  return ans;
}
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) scanf("%d", &A[i]), A[i]--;
    getIn(n);
    int ans = 0, x = 0, y = n / 8, las = 0;
    while (x <= y) {
      int m = (x + y) / 2;
      int res = solve(n, m);
      if (res != -INF) {
        ans = max(ans, res * (m + 1) + (8 - res) * m);
        x = m + 1;
        las = m;
      } else
        y = m - 1;
    }
    int tmp = 0;
    for (int i = 0; i < maxv; i++)
      if (!in[i].empty()) tmp++;
    printf("%d\n", max(ans, tmp));
  }
  return 0;
}
