#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}


template<long long MOD>
class ModInt {
public:
	const static long long mod = MOD;
	long long x;
	
	ModInt() {
		x = 0;
	}

	ModInt(long long x) {
		x %= mod;
		this->x = x < 0 ? x+mod : x;
	}

	int get() const {
		return (int)x;
	}

	ModInt &operator+=(ModInt that) {
		if((x += that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator-=(ModInt that) {
		if((x += mod-that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator*=(ModInt that) {
		x = x*that.get()%mod;
		return *this;
	}

	ModInt &operator/=(ModInt that) {
		return *this *= that.inverse();
	}

	ModInt operator+(ModInt that) const {
		return ModInt(*this) += that;
	}

	ModInt operator-(ModInt that) const {
		return ModInt(*this) -= that;
	}

	ModInt operator*(ModInt that) const {
		return ModInt(*this) *= that;
	}

	ModInt operator/(ModInt that) const {
		return ModInt(*this) /= that;
	}

	ModInt inverse() const {
		using std::swap;
		long long a = x, b = mod, u = 1, v = 0;
		while(b) {
			long long t = a/b;
			a -= t*b; swap(a,b);
			u -= t*v; swap(u,v);
		}
		return ModInt(u);
	}

	ModInt pow(int n) const{
		ModInt b = *this;
		ModInt res = 1;
		while(n != 0) {
			if(n&1){
				res *= b;
			}
			b *= b;
			n >>= 1;
		}
		return res;
	}

	bool operator==(ModInt that) const { return x == that.get(); }
	bool operator!=(ModInt that) const { return x != that.get(); }
	ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); }
};

template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { os << m.get(); return os; }
template<long long MOD> istream& operator>> (istream& is, ModInt<MOD>& m){ long long n; is >> n; m = n; return is;}
typedef ModInt<1000000007> mint;


using mint0 = ModInt<1000000007>;
using mint1 = ModInt<1000000009>;
using mint2 = ModInt<999999937>;
using H = tuple<mint0, mint1, mint2>;

class RollingHash {
public:
	using mint0 = ModInt<1000000007>;
	using mint1 = ModInt<1000000009>;
	using mint2 = ModInt<999999937>;
	using H = tuple<mint0, mint1, mint2>;
	mint0 b0;
	mint1 b1;
	mint2 b2;
	vector<H> table;
	vector<H> power_inv;

	RollingHash(const string& s, int b0i = 2, int b1i = 3, int b2i = 5) {
		int n = s.size();
		table.reserve(n + 1);

		b0 = b0i;
		b1 = b1i;
		b2 = b2i;

		mint0 t0 = 1;
		mint1 t1 = 1;
		mint2 t2 = 1;

		table.emplace_back(0, 0, 0);

		mint0 val0 = 0;
		mint1 val1 = 0;
		mint2 val2 = 0;

		for(auto&& c : s) {
			val0 += t0 * c;
			val1 += t1 * c;
			val2 += t2 * c;
			table.emplace_back(val0, val1, val2);
			t0 *= b0;
			t1 *= b1;
			t2 *= b2;
		}

		power_inv.reserve(n + 1);
		t0 = 1;
		t1 = 1;
		t2 = 1;
		mint0 b0_inv = b0.inverse();
		mint1 b1_inv = b1.inverse();
		mint2 b2_inv = b2.inverse();
		power_inv.emplace_back(t0, t1, t2);
		for (int i = 0; i < n; ++i) {
			t0 *= b0_inv;
			t1 *= b1_inv;
			t2 *= b2_inv;
			power_inv.emplace_back(t0, t1, t2);
		}
	}

	H query(int l, int r) {
		mint0 lval0, rval0, inv0;
		mint1 lval1, rval1, inv1;
		mint2 lval2, rval2, inv2;
		tie(lval0, lval1, lval2) = table[l];
		tie(rval0, rval1, rval2) = table[r];
		tie(inv0, inv1, inv2) = power_inv[l];
		return H((rval0 - lval0) * inv0, (rval1 - lval1) * inv1, (rval2 - lval2) * inv2);
	}
};

struct state {
	int len, link ;
	map < char , int > next ;
};
 
const int MAXLEN = 100000 ;
state st [ MAXLEN * 2 ] ;
int sz, last ;
 
void sa_init () {
	sz = last = 0 ;
	st [ 0 ] . len = 0 ;
	st [ 0 ] . link = - 1 ;
	++ sz ;
} 
 
 void sa_extend ( char c ) {
	int cur = sz ++ ;
	st [ cur ] . len = st [ last ] . len + 1 ;
	int p ;
	for ( p = last ; p != - 1 && ! st [ p ]. next . count ( c ) ; p = st [ p ] . link )
		st [ p ] . next [ c ] = cur ;
	if ( p == - 1 )
		st [ cur ] . link = 0 ;
	else {
		int q = st [ p ] . next [ c ] ;
		if ( st [ p ] . len + 1 == st [ q ] . len )
			st [ cur ] . link = q ;
		else {
			int clone = sz ++ ;
			st [ clone ] . len = st [ p ] . len + 1 ;
			st [ clone ] . next = st [ q ] . next ;
			st [ clone ] . link = st [ q ] . link ;
			for ( ; p != - 1 && st [ p ] . next [ c ] == q ; p = st [ p ] . link )
				st [ p ] . next [ c ] = clone ;
			st [ q ] . link = st [ cur ] . link = clone ;
		}
	}
	last = cur ;
}



int main()
{
	ios_init();
	int n;
	string s;
	cin >> n >> s;
	{
		// int p = 0;
		sa_init();
		int ans = 0;
		DEBUG(sz);
		REP(i, n) {
			int p = i;
			int l = p;
			int cur = 0;
			while(st[cur].next.count(s[p])) {
				DEBUG(st[cur].next[s[p]]);
				cur = st[cur].next[s[p]];
				p++;
			}
			DEBUG(p);
			chmax(ans, p - l);
			sa_extend(s[i]);
		}
		cout << ans << endl;
		// RollingHash ht(s, 2, 3, 5);
		// int l = 0, r = SZ(s) + 1;
		// auto check = [&](int l) -> bool {
		// 	using H = tuple<LL, LL, LL>;
		// 	set<H> cnt;
		// 	queue<H> qu;
		// 	REP(i, SZ(s) - l + 1) {
		// 		auto tmp = ht.query(i, i + l);
		// 		mint0 a;
		// 		mint1 b;
		// 		mint2 c;
		// 		tie(a, b, c) = tmp;
		// 		if(cnt.count(H(a.get(), b.get(), c.get()))) return true;
		// 		qu.push(H(a.get(), b.get(), c.get()));
		// 		if(SZ(qu) >= l) {
		// 			cnt.insert(qu.front());
		// 			qu.pop();
		// 		}
		// 		DEBUG(SZ(qu));
		// 	}
		// 	// for(auto&& e : cnt) {
		// 	// 	if(e.S >= 2) return true;
		// 	// }
		// 	return false;
		// };
		// while(l + 1 < r) {
		// 	int m = (l + r) / 2;
		// 	DEBUG(m);
		// 	// DEBUG(check(m));
		// 	if(check(m)) {
		// 		l = m;
		// 	} else {
		// 		r = m;
		// 	}
		// }
		// cout << l << endl;
	}
	return 0;
}


Measured memory_bytes: 11776