Given the string s. Find a maximum integer k such that there is a non-empty substring in the string s that is a concatenation of

k equal strings. This problem is from: https://mirror.codeforces.com/edu/course/2/lesson/2/5/practice/contest/269656/problem/F

|s| <= 4e5

Thanks!