Problem B - Periodic Strings 
----------------------------

A character string is said to have period k if it can be formed by
concatenating one or more repetitions of another string of length k. For
example, the string "abcabcabcabc" has period 3, since it is formed by 4
repetitions of the string "abc". It also has periods 6 (two repetitions
of "abcabc") and 12 (one repetition of "abcabcabcabc").

Write a program to read a character string and determine its smallest
period.

Input
-----

The first line of the input will contain a single integer N indicating
how many test cases there are.  Each test case is in a separate line and
will contain a single character string of up to 80 non-blank characters. 

Output
------

For each test case, output in a separate line an integer denoting the
smallest period of the input string.

Sample Input
------------

2
HoHoHo
abcabcabcabc

Output for Sample Input
-----------------------

2
3