#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5, A = 1e5 + 10, md = 1e9 + 7;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int takemod(int a, int mod) {
  a %= mod;
  if (a < 0) a += mod;
  return a;
}
int fast_exp(int base, int expo, int mod) {
  int res = 1;
  while (expo > 0) {
    if (expo & 1) res = (res * base) % mod;
    base = (base * base) % mod;
    expo >>= 1;
  }
  return res;
}
int modinv(int a, int mod) {
  return takemod(fast_exp(takemod(a, mod), mod - 2, mod), mod);
}
int dp[26], c[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    int n;
    cin >> n;
    string s;
    cin >> s;
    int cnt = 0;
    for (int i = 0; i < n / 2; i++) {
      if (s.substr(0, i + 1) == s.substr(i + 1, i + 1)) {
        cnt = max(cnt, i);
      }
    }
    cout << n - cnt << endl;
  }
  return 0;
}
