#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
pair<long long, long long> p;
map<long long, long long> mp;
set<long long> st;
deque<long long> dq;
priority_queue<long long> pq;
long long mn = INT_MAX, mx = INT_MIN;
long long n, m, tc, i, j, tmp, sum, cn, ans, res, pos, flag;
string s;
long long a[200007], b[200007];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> s;
  ans = 1;
  for (i = 1; i <= n; i++) {
    if (s.substr(0, i) == s.substr(i, i)) ans = i;
  }
  cout << n - ans + 1;
  return 0;
}
