1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33

#include <bits/stdc++.h>
using namespace std;

int main() {
	ifstream cin("whereami.in");
	ofstream cout("whereami.out");

	int N;
	cin >> N;
	string S;
	cin >> S;

	for (int K = 1; K <= N; ++K) {
		bool good = true;

		for (int a = 0; a <= N - K; ++a) {
			for (int b = 0; b <= N - K; ++b) {
				if (a == b) continue;

				bool string_equal = true;
				for (int i = 0; i <= K - 1; ++i) {
					if (S[a + i] != S[b + i]) string_equal = false;
				}

				if (string_equal) good = false;
			}
		}

		if (good) {
			cout << K;
			return 0;
		}
	}
}