#include <bits/stdc++.h>
using namespace std;
long long sum(long long a[], long long n, long long s) {
  for (long long i = 0; i < n; i++) s += a[i];
  return s;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
char s[117];
void solve() {
  static long long n, d, i, g, j, maxi;
  cin >> n;
  cin >> s;
  for (i = 1; i < n; i += 2) {
    g = 0;
    for (j = 0; j <= (i / 2); j++) {
      if (s[j] != s[j + ((i + 1) / 2)]) {
        g = 1;
        break;
      }
    }
    if (g == 0) {
      maxi = i;
      d = 1;
    }
  }
  cout << n - ((maxi + 1) / 2) + d;
  return;
}
int main() {
  long long t, T;
  T = 1;
  for (t = 1; t <= T; t++) {
    solve();
  }
  return 0;
}
