The string \textbf{s} is given. Find the string \textbf{t} of minimum length such that \textbf{s} can be represented as a concatenation of one or some copies of \textbf{t}. \InputFile One string \textbf{s} (\textbf{1} ≤ |\textbf{s}| ≤ \textbf{5·10^6}) that contains the latin letters only. \OutputFile The length of a string \textbf{t}.