#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int maxn = 105;
int n;
char s[105];
int main() {
  scanf("%d%s", &n, s + 1);
  int cnt = n;
  int mid;
  if (n % 2) {
    mid = (n + 1) / 2;
  } else
    mid = n / 2 + 1;
  for (int i = mid; i >= 2; i--) {
    int flag = 1;
    for (int j = 1; j <= i - 1; j++) {
      if (s[j] != s[j + i - 1]) {
        flag = 0;
        break;
      }
    }
    if (flag) {
      cnt = 1;
      cnt += (n - i + 1);
      break;
    }
  }
  printf("%d", cnt);
  return 0;
}
