#include <bits/stdc++.h>
using namespace ::std;
const int k = 8;
const int maxn = 1e3 + 10;
const int maxm = (1 << k) + 10;
int n, a[maxn], dp[maxn][maxm], ans, cur[k];
vector<int> p[8];
void init() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    a[i]--;
    p[a[i]].push_back(i);
  }
}
int get_ans(int len) {
  memset(cur, 0, sizeof(cur));
  memset(dp, -1, sizeof(dp));
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int mask = 0; mask < (1 << k); mask++) {
      if (dp[i][mask] == -1) continue;
      for (int v = 0; v < k; v++) {
        if (mask & (1 << v)) continue;
        int pos = cur[v] + len - 1;
        if (pos < p[v].size())
          dp[p[v][pos] + 1][mask | (1 << v)] =
              max(dp[p[v][pos] + 1][mask | (1 << v)], dp[i][mask]);
        pos++;
        if (pos < p[v].size()) {
          dp[p[v][pos] + 1][mask | (1 << v)] =
              max(dp[p[v][pos] + 1][mask | (1 << v)], dp[i][mask] + 1);
        }
      }
    }
    cur[a[i]]++;
  }
  int ret = -1;
  for (int i = 0; i <= n; i++) ret = max(ret, dp[i][(1 << k) - 1]);
  if (ret == -1) return ret;
  return ret * (len + 1) + (8 - ret) * len;
}
void solve() {
  int l = 1, r = n / k + 1;
  ans = -1;
  for (int times = 0; times <= 20; times++) {
    int mid = (l + r) / 2;
    ans = get_ans(mid);
    if (ans != -1) {
      l = mid;
    } else {
      r = mid;
    }
  }
  ans = max(get_ans(l), get_ans(r));
  if (ans == -1) {
    ans = 0;
    for (int i = 0; i < k; i++) {
      if (p[i].size() > 0) ans++;
    }
  }
  printf("%d\n", ans);
}
int main() {
  init();
  solve();
  return 0;
}
