#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
const int MOD = int(1e9 + 7);
int main() {
  int n;
  const int NN = 201010;
  static char s[NN];
  static int p[NN], h[NN];
  static map<pair<int, int>, vector<int> > mp[NN];
  gn(n);
  scanf("%s", s + 1);
  for (int i = p[0] = 1; i <= n; i++) p[i] = (long long)p[i - 1] * 29 % MOD;
  for (int i = 1; i <= n; i++)
    h[i] = ((long long)h[i - 1] * 29 + s[i] - 'a') % MOD;
  auto calc = [](int u, int v) {
    return (h[v] - (long long)h[u - 1] * p[v - u + 1] % MOD + MOD) % MOD;
  };
  for (int i = 1; i <= n; i++)
    mp[1][pair<int, int>(calc(i, i), 1)].push_back(i);
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (!mp[i].empty()) {
      ans = i;
      for (auto it : mp[i]) {
        vector<int> &a = it.second, mid;
        int len = it.first.second;
        for (int j = 1; j < a.size(); j++)
          mid.push_back(calc(a[j - 1], a[j] + len - 1));
        for (int j = 0, k; j < mid.size(); j = k) {
          for (k = j; k < mid.size(); k++)
            if (mid[j] != mid[k]) break;
          mp[i + k - j]
            [pair<int, int>(calc(a[j], a[k] + len - 1), a[k] + len - a[j])]
                .push_back(a[j]);
        }
      }
    }
  println(ans);
  return 0;
}
