#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3fll;
const long long M = 1e9 + 7;
const long long maxn = 1e6 + 7;
const double eps = 0.00000001;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <typename T>
inline T powMM(T a, T b) {
  T ret = 1;
  for (; b; b >>= 1ll, a = 1ll * a * a % M)
    if (b & 1) ret = 1ll * ret * a % M;
  return ret;
}
int n, m;
int i, j, k;
char a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  scanf("%s", a);
  int ans = n;
  for (k = 1; k <= n; k++) {
    for (i = 0; i < k; i++)
      if (a[i] != a[i + k]) break;
    if (i == k) ans = n - k + 1;
  }
  printf("%d\n", ans);
}
