{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"假设s可以由t重复k次拼成,即s\u003dtttt……tt,我们称为s\u003dt^k。先给定一个字符串s,求最大的n使得存在t满足s\u003dt^n。"}},{"title":"Input","value":{"format":"MD","content":"多组数据,每行一个字符串(仅包含可打印字符且长度不超过1000000),以单独一行.作为终结标志"}},{"title":"Output","value":{"format":"MD","content":"每组数据一行答案\n"}},{"title":"Sample Input","value":{"format":"MD","content":"abcd\naaaa\nababab\n.\n"}},{"title":"Sample Output","value":{"format":"MD","content":"1\n4\n3\n"}},{"title":"Hint","value":{"format":"MD","content":"This problem has huge input, use scanf instead of cin to avoid time limit exceed.\n"}}]}