#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const double eps = 1e-12;
const double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
int cnt[200001][100];
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[i]--;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 100; j++) cnt[i + 1][j] += cnt[i][j];
    cnt[i + 1][a[i]]++;
  }
  int ans = 0;
  vector<int> mp[100][100];
  for (int i = 0; i < 100; i++)
    for (int j = 0; j < 100; j++) mp[i][j].push_back(-1);
  for (int i = 1; i <= n; i++) {
    int ma = -1, chk = -1;
    for (int j = 0; j < 100; j++) {
      if (cnt[i][j] > ma) {
        ma = cnt[i][j];
        chk = j;
      }
    }
    int tmp = 0;
    for (int j = 0; j < 100; j++)
      if (cnt[i][j] == ma) tmp++;
    if (tmp >= 2) {
      ans = max(ans, i);
    } else {
      int mi = mod;
      for (int j = 0; j < 100; j++)
        if (j != chk) {
          int dif = cnt[i][chk] - cnt[i][j];
          if (dif < mp[chk][j].size()) {
            mi = min(mi, mp[chk][j][dif]);
          }
        }
      ans = max(ans, i - mi);
    }
    int z = a[i - 1];
    for (int j = 0; j < 100; j++)
      if (j != z) {
        int dif = cnt[i][z] - cnt[i][j];
        if (dif > 0) {
          if (dif >= mp[z][j].size()) {
            mp[z][j].push_back(i);
          }
        }
      }
  }
  cout << ans << "\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
