#include<bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end());
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using ull=unsigned long long;
using vint=vector<int>;
using vvint=vector<vint>;
using pint=pair<int, int>;
using vpint=vector<pint>;
constexpr double pi = 3.1415926535897932384626433832795028;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> using priority_queue_rev=priority_queue<T, vector<T>, greater<T>>;
template<typename T1, typename T2> inline bool chmax(T1 &a, const T2 &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T1, typename T2> inline bool chmin(T1 &a, const T2 &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct Setup {
    static constexpr int PREC = 20;
    Setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

struct RollingHash {
    using ull=unsigned long long;
    static constexpr ull MASK30 = (1ULL << 30) - 1;
    static constexpr ull MASK31 = (1ULL << 31) - 1;
    static constexpr ull MOD = (1ULL << 61) - 1;
    static constexpr ull POSITIVIZER = MOD * 4;
    static const ull B0, B1;
    static std::random_device rng;
    static std::vector<ull> powB0, powB1;
    const int n;
    std::vector<ull> h0{0}, h1{0};
    ull mul(ull a, ull b) const {
        ull au = a >> 31;
        ull ad = a & MASK31;
        ull bu = b >> 31;
        ull bd = b & MASK31;
        ull mid = ad * bu + au * bd;
        return (au * bu << 1) + (mid >> 30) + ((mid & MASK30) << 31) + ad * bd;
    }
    ull calcMod(ull val) const {
        val = (val & MOD) + (val >> 61);
        if (val > MOD) { val -= MOD; }
        return val;
    }
    template<typename Itr> RollingHash(Itr begin, Itr end): n(end - begin) {
        for (auto itr = begin; itr != end; itr++) {
            h0.push_back(calcMod((mul(h0.back(), B0) + *itr)));
            h1.push_back(calcMod((mul(h1.back(), B1) + *itr)));
        }
        while (powB0.size() <= n) {
            powB0.push_back(calcMod(mul(powB0.back(), B0)));
            powB1.push_back(calcMod(mul(powB1.back(), B1)));
        }
    }
    std::pair<ull, ull> get(int l, int r) const {
        return {calcMod((h0[r] + POSITIVIZER - mul(h0[l], powB0[r - l]))),
                calcMod((h1[r] + POSITIVIZER - mul(h1[l], powB1[r - l])))};
    }
};
std::random_device RollingHash::rng;
const RollingHash::ull RollingHash::B0 = std::uniform_int_distribution<ull>(1, (MOD >> 1) - 1)(rng);
const RollingHash::ull RollingHash::B1 = std::uniform_int_distribution<ull>(MOD >> 1, MOD - 1)(rng);
std::vector<RollingHash::ull> RollingHash::powB0{1};
std::vector<RollingHash::ull> RollingHash::powB1{1};

long long binarySearch(long long ok, long long ng, std::function<bool(int)> check) {
    while (abs(ok - ng) > 1) {
        long long mid = ok + ng >> 1;
        (check(mid) ? ok : ng) = mid;
    }
    return ok;
}

struct Hash {
    int operator()(const pair<ull, ull> &x) const { return x.first ^ x.second; }
};

int N;
string S;
signed main() {
    cin >> N >> S;
    RollingHash rh(all(S));
    for (int x = N / 2; x >= 0; x--) {
        unordered_map<pair<ull, ull>,int, Hash> mp;
        rep(i, N - x + 1) {
            auto cur = rh.get(i, i + x);
            if (mp.count(cur) != 0) {
                if (mp[cur] <= i - x) {
                    cout << x << endl;
                    return 0;
                }
            } else { mp[cur] = i; }
        }
    }
}


Measured memory_bytes: 928