#include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
int main(void) {
  int n;
  scanf("%d", &n);
  char a[105];
  int f[105];
  scanf("%s", a + 1);
  int ans = n;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= i; ++j) {
      bool ok = true;
      if (j - 1 != i - j + 1) continue;
      for (int k = 1; k <= j - 1; ++k)
        if (a[k] != a[k + j - 1]) {
          ok = false;
          break;
        }
      if (!ok) continue;
      ans = min(ans, j - 1 + 1 + (n - i));
    }
  }
  cout << ans << endl;
  return 0;
}
