#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
  x = 0;
  char ch = getchar();
  long long f = 1;
  while (!isdigit(ch)) {
    if (ch == '-') f *= -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - 48;
    ch = getchar();
  }
  x *= f;
}
template <typename T, typename... Args>
void read(T &first, Args &...args) {
  read(first);
  read(args...);
}
template <typename T>
void write(T arg) {
  T x = arg;
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (x > 9) {
    write(x / 10);
  }
  putchar(x % 10 + '0');
}
template <typename T, typename... Ts>
void write(T arg, Ts... args) {
  write(arg);
  if (sizeof...(args) != 0) {
    putchar(' ');
    write(args...);
  }
}
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const int N = 2e5 + 5;
int n;
int a[N];
int buck[N], cnt, val;
unordered_map<int, int> ma;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  int maxn = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    buck[a[i]]++;
    if (buck[a[i]] > maxn)
      maxn = buck[a[i]], cnt = 1, val = a[i];
    else if (buck[a[i]] == maxn)
      cnt++;
  }
  if (cnt > 1)
    cout << n << endl;
  else {
    int ans = 0;
    for (int i = 1; i <= 100; i++) {
      if (i == val) continue;
      int v = 0;
      ma.clear();
      ma[0] = 0;
      for (int j = 1; j <= n; j++) {
        if (a[j] == i) v++;
        if (a[j] == val) v--;
        if (!ma.count(v))
          ma[v] = j;
        else
          ans = max(ans, j - ma[v]);
      }
    }
    cout << ans << endl;
  }
}
