#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  vector<int> min;
  string a = "";
  bool sub = false;
  for (int i = 0; i < s.size() / 2; i++) {
    a += s[i];
    int k = 0;
    sub = true;
    for (int j = a.size(); j < a.size() + i + 1; j++) {
      if (a[k] != s[j]) {
        sub = false;
        break;
      }
      k++;
    }
    if (sub) {
      min.push_back(1 + s.size() - a.size());
    }
  }
  sort(min.begin(), min.end());
  if (min.size() != 0)
    cout << min[0];
  else
    cout << s.size();
}
