#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
inline int getint() {
  int x;
  scanf("%d", &x);
  return x;
}
inline long long getlng() {
  long long x;
  scanf("%lld", &x);
  return x;
}
int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};
void solve();
const double eps = (double)1e-9;
int n;
string s;
int chk(int idx) {
  int len = idx;
  bool y = true;
  int j = 0;
  for (int i = idx; i < min(idx + idx, n); ++i) {
    if (s[i] != s[j]) {
      y = false;
    }
    j++;
  }
  if (j != idx) return 0;
  if (y) return idx;
  return 0;
}
void mm() {
  cin >> n;
  cin >> s;
  int ans = 0;
  for (int i = 0; i < ((int)s.size()); ++i) {
    int g = chk(i);
    ans = max(ans, g);
  }
  cout << (n - ans) + (ans == 0 ? 0 : 1) << '\n';
}
int main() {
  mm();
  return 0;
}
