#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 7 + 1000;
int ans = 0;
int dig[MAX_N];
int tag[10], tab[10];
int pos[10][MAX_N], num[10];
int sum[MAX_N][10];
bool pass(int mask, int mid) {
  int now = 0;
  for (int i = 0; i < 8; i++) tag[i + 1] = (mask >> i) & 1;
  for (int i = 1; i <= 8; i++) {
    int d = tab[i];
    int ned = mid + tag[i];
    if (!ned) continue;
    if (sum[now][d] + ned > num[d]) return false;
    now = pos[d][sum[now][d] + ned];
  }
  return true;
}
void work(int mask) {
  int ret = -1;
  for (int l = 0, r = 130, mid = (l + r) >> 1; l <= r; mid = (l + r) >> 1) {
    if (pass(mask, mid))
      l = (ret = mid) + 1;
    else
      r = mid - 1;
  }
  if (~ret) ans = max(ans, ret * 8 + __builtin_popcount(mask));
}
int main() {
  for (int i = 1; i <= 8; i++) tab[i] = i;
  memset(num, 0, sizeof(num));
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &dig[i]);
    pos[dig[i]][++num[dig[i]]] = i;
    for (int j = 1; j <= 8; j++) sum[i][j] = sum[i - 1][j];
    sum[i][dig[i]]++;
  }
  for (;;) {
    for (int i = 0, lim = (1 << 8); i < lim; i++) work(i);
    if (!next_permutation(tab + 1, tab + 1 + 8)) break;
  }
  printf("%d", ans);
}
