Power Strings

Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).

Input

Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.

Output

For each s you should print the largest n such that s = a^n for some string a.

Sample Input

abcd
aaaa
ababab
.

Sample Output

1
4
3

Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

求所给字符串的循环个数

定理：假设S的长度为len，则S存在循环子串，当且仅当，len可以被len - next[len]整除，最短循环子串为S[len - next[len]]
例子证明：

设S=q₁q₂q₃q₄q₅q₆q₇q₈，并设next[8] = 6，此时str = S[len - next[len]] = q₁q₂，由字符串特征向量next的定义可知，q₁q₂q₃q₄q₅q₆ = q₃q₄q₅q₆q₇q₈，即有q₁q₂＝q₃q₄，q₃q₄＝q₅q₆，q₅q₆＝q₇q₈，即q₁q₂为循环子串，且易知为最短循环子串。由以上过程可知，若len可以被len - next[len]整除，则S存在循环子串，否则不存在。
解法：利用KMP算法，求字符串的特征向量next，若len可以被len - next[len]整除，则最大循环次数n为len/(len - next[len])，否则为1。

#include<stdio.h>
#include<string.h>
using namespace std;
const int N = 1000005;
char p[N];
int next[N];
void getNext(char p[],int m,int next[]){
	int j=0;
	int t=-1;
	next[0]=-1;
	while(j<m){
		if(t<0||p[j]==p[t]){
			next[++j]=++t;
		}
		else t=next[t];
	}
}
int main(){
	while(scanf("%s",p)!=EOF){
		if(p[0]=='.') break;
		memset(next,0,sizeof(next));
		int m=strlen(p);
		getNext(p,m,next);
		int n=m-next[m];//求出已经循环的字符个数 
		if(n!=m&&m%n==0) printf("%d\n",m/n);
		else printf("1\n");
	}
	return 0;
}