using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        var S = cin.next;
        var R = S.Manacher();
        int len;
        for (len = 2; len < S.Length; len++)
        {
            var flag = true;
            for (int i = len - 1; i < N; i += len - 1)
            {
                if (R[i] != Min(i + 1, N - i))
                {
                    flag = false;
                    break;
                }
            }
            if (flag)
            {
                break;
            }
        }
        WriteLine(len);
    }
}

static class Mana
{
    /// <summary>s[i]を中心とする最長回文の半径を求める．O(|S|)</summary>
    /// <returns>R[i]=iを中心とする最長回文の半径</returns>
    public static int[] Manacher(this string s)
    {
        var R = new int[s.Length];
        int i = 0, j = 0;
        while (i < s.Length)
        {
            while (i - j >= 0 && i + j < s.Length && s[i - j] == s[i + j]) ++j;
            R[i] = j;
            int k = 1;
            while (i - k >= 0 && i + k < s.Length && k + R[i - k] < j) { R[i + k] = R[i - k]; ++k; }
            i += k; j -= k;
        }
        return R;
    }
    /// <summary>s[i]を中心とする最長回文の半径を(偶数長のものも含めて)求める．O(|S|)</summary>
    /// <returns>ret[i]=i/2を中心とする最長回文の半径．iが奇数のときは偶数長</returns>
    public static int[] ManacherWithEven(this string s)
    {
        var sb = new System.Text.StringBuilder();
        foreach (var x in s)
        {
            sb.Append(x);
            sb.Append('$');
        }
        var t = sb.ToString();
        var ret = Manacher(t);
        for (int i = 1; i < ret.Length; i += 2) ret[i] = ret[i] / 2;
        var ret2 = Manacher(s);
        for (int i = 0; i < ret.Length; i += 2) ret[i] = ret2[i / 2];
        return ret;
    }
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}



Measured memory_bytes: 25208