#include <bits/stdc++.h>
using namespace std;
int a[1005];
int dp[1005][1 << 8];
bool vis[1005][1 << 8];
vector<int> pos[8];
int n;
int nextpos(int crt, int num, int k) {
  if (k == 0) return crt;
  const vector<int>& v = pos[num];
  int p = lower_bound(v.begin(), v.end(), crt) - v.begin();
  p = p + k - 1;
  if (p >= (int)v.size())
    return n;
  else
    return v[p];
}
int solve(int seglen) {
  memset(dp, 0, sizeof(dp));
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < n; ++i) vis[i][0] = true;
  int maxstate = (1 << 8) - 1;
  for (int i = 0; i < n; ++i) {
    for (int s = 0; s <= maxstate; ++s) {
      if (!vis[i][s]) continue;
      for (int num = 0; num < 8; ++num) {
        if (!(s & (1 << num))) {
          int p = nextpos(i, num, seglen);
          if (p < n) {
            dp[p][s | (1 << num)] = max(dp[p][s | (1 << num)], dp[i][s] + 1);
            vis[p][s | (1 << num)] = true;
          }
          p = nextpos(i, num, seglen - 1);
          if (p < n) {
            dp[p][s | (1 << num)] = max(dp[p][s | (1 << num)], dp[i][s]);
            vis[p][s | (1 << num)] = true;
          }
        }
      }
    }
  }
  int cnt = 0;
  for (int i = 0; i < n; ++i) cnt = max(cnt, dp[i][maxstate]);
  if (cnt == 0)
    return 0;
  else
    return (cnt * seglen) + (8 - cnt) * (seglen - 1);
}
int main(int argc, char* argv[]) {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    --a[i];
    pos[a[i]].push_back(i);
  }
  int maxlen = 0;
  for (int i = 0; i < 8; ++i) maxlen = max(maxlen, (int)pos[i].size());
  int ans = 0;
  for (int i = 0; i < 8; ++i) {
    if (pos[i].size() > 0) ++ans;
  }
  for (int len = 2; len <= maxlen; ++len) ans = max(ans, solve(len));
  printf("%d\n", ans);
  return 0;
}
