#include <bits/stdc++.h>
using namespace std;
int n, a[1005], in[1005], f[1005][300];
vector<int> pos[10];
int check(int x) {
  for (int i = 0; i <= n; ++i)
    for (int j = 1; j < 256; ++j) f[i][j] = -1e9;
  f[0][0] = 0;
  if (!x)
    for (int i = 1; i < 256; ++i) f[0][i] = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < 256; ++j) {
      f[i][j] = max(f[i][j], f[i - 1][j]);
      for (int k = 0; k < 8; ++k) {
        if ((j >> k & 1) && a[i] == k) {
          if (x && in[i] >= x - 1) {
            int tmp = pos[k][in[i] - x + 1];
            f[i][j] = max(f[i][j], f[tmp - 1][j ^ (1 << k)] + x);
          }
          if (in[i] >= x) {
            int tmp = pos[k][in[i] - x];
            f[i][j] = max(f[i][j], f[tmp - 1][j ^ (1 << k)] + x + 1);
          }
        }
      }
    }
  }
  return f[n][255];
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    a[i]--;
    in[i] = pos[a[i]].size();
    pos[a[i]].push_back(i);
  }
  int l = 0, r = n;
  while (l < r) {
    int mid = (l + r + 1) / 2;
    if (check(mid) >= 0)
      l = mid;
    else
      r = mid - 1;
  }
  cout << check(l);
}
