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.

#include <iostream>
#include <cstdio>
#include <cstring>
const int MAX=1e6+10;
int next[MAX];
char str[MAX];
void getnext(int  l)
{
	  int i = 0 , j = -1;
	  next[0] = -1;
	  while( i < l )
	  {
	  	     if(j == -1 || str[j] == str[i])
	  	      {
	  	      	    i++;
	  	      	    j++;
	  	      	    next[i] = j;
				}
			else
			  j = next[j];
	  }
}
int main()
{      
      while( ~scanf("%s",str) )
      {    
            if(str[0] == '.')
             break;
      	   int l = strlen(str);
      	     getnext(l);
      	  int sum = 1;
      	 if(l % (l - next[l]) == 0)
      	       sum = l / ( l - next[l] );
      	 printf("%d\n",sum);
	  }
	  return 0;
}