B'Ivan wants to write a letter to his friend. The letter is a string s consisting of lowercase Latin letters. Unfortunately, when Ivan started writing the letter, he realised that it is very long and writing the whole letter may take extremely long time. So he wants to write the compressed version of string s instead of the string itself. The compressed version of string s is a sequence of strings c1, xe2 x80 x89s1, xe2 x80 x89c2, xe2 x80 x89s2, xe2 x80 x89..., xe2 x80 x89ck, xe2 x80 x89sk, where ci is the decimal representation of number ai (without any leading zeroes) and si is some string consisting of lowercase Latin letters. If Ivan writes string s1 exactly a1 times, then string s2 exactly a2 times, and so on, the result will be string s. The length of a compressed version is |c1| xe2 x80 x89+ xe2 x80 x89|s1| xe2 x80 x89+ xe2 x80 x89|c2| xe2 x80 x89+ xe2 x80 x89|s2|... |ck| xe2 x80 x89+ xe2 x80 x89|sk|. Among all compressed versions Ivan wants to choose a version such that its length is minimum possible. Help Ivan to determine minimum possible length. The only line of input contains one string s consisting of lowercase Latin letters (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89|s| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x898000). Output one integer number -- the minimum possible length of a compressed version of s. In the first example Ivan will choose this compressed version: c1 is 10, s1 is a. In the second example Ivan will choose this compressed version: c1 is 1, s1 is abcab. In the third example Ivan will choose this compressed version: c1 is 2, s1 is c, c2 is 1, s2 is z, c3 is 4, s3 is ab. '...