通过测试用例但超时了, 有时间再改
正解用到了差分数组-1+1
for _ in range(int(input())):
s = input()
print(s)
pre = len(s) // 2
max_ = 0
while pre >= 1:
for i in range(pre, len(s)):
if s[i:i+pre] == s[:pre]:# '匹配到和前缀相等的, 接下来找有没有连续'
n = 1
while i + (n+1) * pre <= len(s) and s[i+(n)*pre:i+(n+1)*pre] == s[:pre]:
n += 1
max_ = max(max_, pre * n)
pre -= 1
print(max_)