#include <bits/stdc++.h>
using namespace std;
int n, L = 1;
int arr[1000], wraya[1000];
vector<vector<int> > vec(9);
int dp[1000][1 << 8];
int solve(int ind, int msk) {
  if (ind == n) {
    if (msk == (1 << 8) - 1) return 0;
    return -1e9;
  }
  if (dp[ind][msk] != -1) return dp[ind][msk];
  int ret = solve(ind + 1, msk);
  if (!(msk & (1 << arr[ind]))) {
    int nmsk = msk | (1 << arr[ind]);
    if (L + wraya[ind] < vec[arr[ind]].size())
      ret = max(ret, solve(vec[arr[ind]][L + wraya[ind]] + 1, nmsk) + L + 1);
    if (L + wraya[ind] - 1 < vec[arr[ind]].size())
      ret = max(ret, solve(vec[arr[ind]][L + wraya[ind] - 1] + 1, nmsk) + L);
  }
  return dp[ind][msk] = ret;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    arr[i]--;
    vec[arr[i]].push_back(i);
    wraya[i] = vec[arr[i]].size() - 1;
  }
  int t = 8;
  for (int i = 0; i < 8; i++)
    if (!vec[i].size()) t--;
  if (t < 8) return cout << t, 0;
  int ans = t;
  for (int i = 1; i < 126; i++)
    memset(dp, -1, sizeof dp), L = i, ans = max(ans, solve(0, 0));
  cout << ans;
  return 0;
}
