#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
#include <utility>
#include <set>
#include <stack>
#include <deque>
#include <ctime>
#include <random>
#include <cassert>
#include <cmath>
#include <climits>
#include <queue>
#include <cstring>
#include <bitset>
#include <iomanip>
#include <chrono>
#include <unordered_set>


/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("popcnt")
#pragma GCC target("avx2")*/



#ifdef LOCAL
#define dbg(x) cout << #x << " : " << x << endl;
#else
#define dbg(x)
#endif

#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a,b) for (int i=a;i<b;i++)
#define fj(a,b) for (int j=a;j<b;j++)
#define fk(a,b) for (int k=a;k<b;k++)
#define fi1(a,b) for (int i=a-1;i>=b;i--)
#define fj1(a,b) for (int j=a-1;j>=b;j--)
#define fk1(a,b) for (int k=a-1;k>=b;k--)
#define fx(x,a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, T2 y) { if (x < y) x = y; }

ostream& operator << (ostream &a, const vector<int> &b) {
for (auto k : b) cout << k << ' ';
return a;
}


typedef long long ll;
typedef unsigned long long ull;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 500010;
const double EPS = 1e-9;
const int ALPHABET = 250;
const int BASE = 257;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());



str s;


int n;

void sufarr() {
fx(x, s)
partial_sum(cnt, cnt + ALPHABET, cnt);
fi(0, n)
int classes = 1;
fi(1, n) {
}
for (int k = 0; (1 << k) < n; ++k) {
fi(0, n) {
}
memset(cnt, 0, classes * sizeof(int));
fi(0, n)
partial_sum(cnt, cnt + classes, cnt);
fi1(n, 0)
classes = 1;
fi(1, n) {
if (right1 >= n) right1 -= n;
if (right2 >= n) right2 -= n;
++classes;
}
memcpy(c, cn, n * sizeof(int));
}
}

void build_lcp() {

int cur = 0;
fi(0, n) {
continue;
cur = max(0, cur - 1);
int sz = min(n - i, n - j);
++cur;
}
}


int comp[MX];
bool good[MX];

cin >> n >> s;
if (n == 1) {
cout << "1n";
return 0;
}
s += '$';
++n;
sufarr();
build_lcp();
memset(was, true, sizeof(bool) * n);
int start = n - 2;
dbg(s);
fi(0, n) {
dbg(suf[i]);
}
fi(0, n - 1) {
dbg(lcp[i]);
}
rep(len, 2, n) {
int cur = 0;
fi(0, n - 1) {
if (lcp < len - 1)
++cur;

}
memset(good, false, sizeof(bool) * n);
start -= len;
dbg(start);
for (int i = start; i >= 0; --i) {

}
bool ok = false;
fi(0, n) {

}
if (!ok) {
cout << len - 1 << 'n';
return 0;
}
}