#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define bitcount(x)  __builtin_popcount(x)
#define bitcountll(x)  __builtin_popcountll(x)
// Input
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inp(p) in2(p.F,p.S)
#define llin(a) cin >> a
#define inl(a) scanf("%lld",&a)
#define read(v,i,n) for(i=0;i<n;i++)in(v[i])
#define twod(mat,i,j,n,m) rep(i,n){rep(j,m)in(mat[i][j]);}
#define sc(ch) scanf("%c",&ch)
#define sstr(str) scanf("%s",str)
// Output
#define pr(a) printf("%d ",a)
#define pr2(a,b) printf("%d %d\n",a,b)
#define pr3(a,b,c) printf("%d %d %d\n",a,b,c)
#define prp(p) pr2(p.F,p.S)
#define out(a) printf("%d\n",a)
#define outl(a) printf("%lld\n",a)
#define llpr(a) cout << a << " "
#define llout(a) cout << a << "\n"
#define pinttwod(mat,i,j,n,m) rep(i,n){rep(j,m)pr(mat[i][j]);   lin;}
#define plltwod(mat,i,j,n,m)  rep(i,n){rep(j,m)llpr(mat[i][j]); lin;}
#define byes printf("YES\n")
#define bno printf("NO\n")
#define yes printf("Yes\n")
#define no printf("No\n")
#define lin printf("\n")
// Iterator
#define rep(i,n) for(i=0;i<n;++i)
#define fone(i,n) for(i=1;i<=n;++i)
#define rrep(i,n) for(i=n-1;i>=0;--i)
#define lp(i,a,b) for(i=a;i<b;++i)
#define rlp(i,a,b) for(i=a;i>=b;--i)
#define all(vec) vec.begin(),vec.end()
#define lower(v,k) lower_bound(v.begin(),v.end(),k)-v.begin()
#define upper(v,k) upper_bound(v.begin(),v.end(),k)-v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
// function
#define sz(x) x.size()
#define inrange(i,a,b) (i>=a && i<=b)
#define FLUSH fflush(stdout)
#define precision(x) cout << setprecision(x) << fixed
#define remax(a,b) a=max(a,b)
#define remin(a,b) a=min(a,b)
#define lchild(p) 2*p
#define rchild(p) 2*p+1
#define lseg l,m,2*p
#define rseg m+1,h,2*p+1
#define bhardo(mat,i,j,n,m,t) rep(i,n){rep(j,m)mat[i][j]=t;}
// Debug
#define dbg(v,i,n) for(i=0;i<n;i++)pr(v[i]); lin
#define ck printf("continue\n")
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
	cerr << *it << " = " << a << "\n";
	err(++it, args...);
}
// Data Type
#define ll long long int
#define ii pair<int,int>
#define pli pair<ll,int>
#define triple tuple<int,int,int>
#define vi vector<int>
#define vii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define viii vector<pair<pair<int,int>,int> >
#define vvii vector<vector<pair<int,int> > >
// Constant
const double PI = acos(-1);
const double eps = (1e-9);
const ll INF = 2e9;
const int M = (1e9)+7;
const int N = (1e4)+3;  // check the limit, man
ll po[N],inv[N],hvalue[N];
ll pro(ll a,ll b)
{
    return (a*b)%M;
}
ll power(ll a,ll b)
{
    ll x=1;
    while(b>0)
    {
        if(b&1)
            x=pro(x,a);
        b=b>>1;
        a=pro(a,a);
    }
    return x;
}
void precompute() // precompute the po[N] and inv[N]
{
    po[0]=1,inv[0]=1;
    ll P=137;
    ll I=power(P,M-2);
    int i;
    lp(i,1,N)
        po[i]=pro(po[i-1],P),inv[i]=pro(inv[i-1],I);
}
ll buildhash(string str) // buildhash of string generally to get hash of substring
{
    int i,n=str.size();
    hvalue[0]=str[0];
    lp(i,1,n)
    {
        hvalue[i]=hvalue[i-1]+pro(po[i],str[i]);
        if(hvalue[i]>=M)
            hvalue[i]-=M;
    }
    return hvalue[n-1];
}
ll subquery(int l,int r) // hash of string in range [l,r]
{
    ll temp=hvalue[r];
    if(l>0)
        temp+=(M-hvalue[l-1]);
    return pro(temp,inv[l]);
}
void solve()
{
    int n,i,j,a,k,m;
    in(n);
    string str;
    llin(str);
    precompute();
    buildhash(str);
    k=(n/2);
    vector<pli> vp;
    while(k>0)
    {
        vp.clear();
        for(i=0;i+k-1<n;i++)
            vp.pb(subquery(i,i+k-1),i);
        sort(all(vp));
        m=sz(vp);
        i=0,j=0;
        while(i<m)
        {
            while(j<m && vp[i].F==vp[j].F)
                j++;
            a=vp[j-1].S-vp[i].S;
            if(a>=k && str.substr(vp[i].S,k)==str.substr(vp[j-1].S,k))
                out(k),exit(0);
            i=j;
        }
        k--;
    }
    out(k);
}
int main()
{
    int t=1;
//    in(t);
    while(t--)
        solve();
}








Measured memory_bytes: 640