#include <bits/stdc++.h>
using namespace std;
vector<long long int> primeFactors(long long int n) {
  vector<long long int> a;
  while (n % 2 == 0) {
    a.push_back(2);
    n = n / 2;
  }
  for (int i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      a.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) a.push_back(n);
  return a;
}
long long int mpow(long long int base, long long int exp) {
  base %= (long long)1e7 + 9;
  long long int result = 1ll;
  while (exp > 0) {
    if (exp & 1ll) result = ((long long)result * base) % (long long)1e7 + 9;
    base = ((long long)base * base) % (long long)1e7 + 9;
    exp >>= 1;
  }
  return result;
}
string sconvert(long long int n) {
  stringstream ss;
  ss << n;
  string str = ss.str();
  return str;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second > b.second);
}
template <typename KeyType, typename ValueType>
std::pair<KeyType, ValueType> get_max(const std::map<KeyType, ValueType> &x) {
  using pairtype = std::pair<KeyType, ValueType>;
  return *std::max_element(x.begin(), x.end(),
                           [](const pairtype &p1, const pairtype &p2) {
                             return p1.second < p2.second;
                           });
}
long long modmul(long long a, long long b) {
  return ((a % (long long)1e7 + 9) * (b % (long long)1e7 + 9)) %
             (long long)1e7 +
         9;
}
long long modadd(long long a, long long b) {
  return ((a % (long long)1e7 + 9) + (b % (long long)1e7 + 9) + (long long)1e7 +
          9) %
             (long long)1e7 +
         9;
}
long long modsub(long long a, long long b) {
  return ((a % (long long)1e7 + 9) - (b % (long long)1e7 + 9) + (long long)1e7 +
          9) %
             (long long)1e7 +
         9;
}
void single() {
  int n;
  cin >> n;
  string str;
  cin >> str;
  int big = 1;
  for (int i = 2; i <= n; i += 2) {
    string first = str.substr(0, i / 2);
    string second = str.substr(i / 2, i / 2);
    if (first == second) {
      big = max(big, i);
    }
  }
  cout << (big / 2) + 1 + n - (big) << '\n';
  return;
}
void multiple() {
  int asdf;
  cin >> asdf;
  while (asdf--) {
    single();
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(0);
  ;
  single();
}
