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).

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.

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

#include<bits/stdc++.h>

using namespace std;

const int M=1e6+;

char t[M];

int next[M],tlen;

void getNext()

{

    int i=,j=-;

    next[]=-;

    while(i<tlen)

    {

        if(j==-||t[i]==t[j])

            next[++i]=++j;

        else j=next[j];

    }

}

int main()

{

    while(scanf("%s",t)!=EOF,t[]!='.')

    {

        tlen=strlen(t);

        getNext();

        if(tlen%(tlen-next[tlen])==)

            printf("%d\n",tlen/(tlen-next[tlen]));

        else printf("1\n");

    }

    return ;

}