#include <bits/stdc++.h>
using namespace std;
int gcd(int, int);
long min(long, long, long);
int min(int, int);
int max(int, int);
int max(int a, int b) {
  if (a > b)
    return a;
  else
    return b;
}
int min(int a, int b) {
  if (a < b)
    return a;
  else
    return b;
}
int pal(string b, string c) {
  if (c == b)
    return 1;
  else
    return 0;
}
int gcd(int m, int n) {
  if ((m == 1) || (n == 1))
    return 1;
  else if (m == 0)
    return n;
  else if (n == 0)
    return m;
  else
    return gcd(n, m % n);
}
int min(long a, long b, long c, long d) {
  return (a < b)   ? ((a < c) ? ((a < d) ? a : d) : c)
         : (b < c) ? ((b < d) ? b : d)
         : (c < d) ? c
                   : d;
}
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  int i, j, k;
  cin >> n;
  string a;
  int lenmax = 0;
  int ctr = 0;
  int begindex = 0, endindex = 0;
  cin >> a;
  if (n == 1) {
    cout << "1\n";
    return 0;
  } else if (n == 2) {
    cout << "2\n";
    return 0;
  } else {
    for (i = 1; i <= a.length() / 2; i++) {
      int x = pal(a.substr(0, i), a.substr(i, i));
      if (x == 1) {
        lenmax = 2 * i;
      }
    }
    if (lenmax != 0)
      ctr = n + 1 - lenmax / 2;
    else
      ctr = n;
    cout << ctr << "\n";
    return 0;
  }
}
