#include <bits/stdc++.h>
using namespace std;
long long int bigMod(long long int A, long long int P, int M) {
  long long int R = 1;
  for (A %= M; P; P >>= 1) {
    if (P & 1) R = (R * A) % M;
    A = (A * A) % M;
  }
  return R;
}
long long int bigMul(long long int A, long long int B, long long int M) {
  long long int R = 0;
  for (A %= M; B; B >>= 1) {
    if (B & 1) R = (R + A) % M;
    A = (A + A) % M;
  }
  return R;
}
long long int negMod(long long int A, long long int B) {
  return (((A % B) + B) % B);
}
long long int invMod(long long int A, long long int M) {
  return bigMod(A, M - 2, M);
}
unsigned long long int _pow(unsigned long long int A, int P) {
  unsigned long long int R = 1;
  for (; P; P >>= 1) {
    if (P & 1) R = (R * A);
    A = (A * A);
  }
  return R;
}
template <class T>
T GCD(T x, T y) {
  while (x) x ^= y ^= x ^= y %= x;
  return y;
}
template <class T>
T LCM(T x, T y) {
  return (x / GCD(x, y)) * y;
}
const int INF = 0x3f3f3f3f;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
inline long long cull() {
  long long sign = 1, num;
  register char c;
  c = getchar();
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') sign = -1;
  for (num = 0; (c >= '0' && c <= '9');) {
    num = num * 10 + c - '0';
    c = getchar();
  }
  return num * sign;
}
inline int culi() {
  register char ch = getchar();
  int f = 1, x = 0;
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return f * x;
}
struct pairs {
  int n;
  int m;
  bool operator<(const pairs& num) const { return n > num.n; }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.precision(15);
  int n;
  cin >> n;
  string str;
  cin >> str;
  if (n == 1) {
    printf("1\n");
    return 0;
  }
  int a = n / 2;
  int b = a;
  int mx = n, ln;
  while (b > 0) {
    string sub = "";
    for (int i = 0; i < b; i++) sub += str[i];
    int cont = 0;
    for (int i = 0, j = b; i < b; i++, j++) {
      if (sub[i] != str[j]) break;
      cont++;
    }
    if (cont == b) {
      int ans = n - cont + 1;
      if (mx > ans) {
        mx = ans;
      }
    }
    b--;
  }
  cout << mx << endl;
  return 0;
}
