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 c₁, s₁, c₂, s₂, ..., c_k, s_k, where c_i is the decimal representation of number a_i (without any leading zeroes) and s_i is some string consisting of lowercase Latin letters. If Ivan writes string s₁ exactly a₁ times, then string s₂ exactly a₂ times, and so on, the result will be string s.

The length of a compressed version is |c₁| + |s₁| + |c₂| + |s₂|... |c_k| + |s_k|. Among all compressed versions Ivan wants to choose a version such that its length is minimum possible. Help Ivan to determine minimum possible length.

Input

The only line of input contains one string s consisting of lowercase Latin letters (1 ≤ |s| ≤ 8000).

Output

Output one integer number — the minimum possible length of a compressed version of s.

Note

In the first example Ivan will choose this compressed version: c₁ is 10, s₁ is a.

In the second example Ivan will choose this compressed version: c₁ is 1, s₁ is abcab.

In the third example Ivan will choose this compressed version: c₁ is 2, s₁ is c, c₂ is 1, s₂ is z, c₃ is 4, s₃ is ab.

Idx	Name	Rating
A	Binary Protocol	1100
B	Five-In-a-Row	1600
C	Multi-judge Solving	1600
D	Suitable Replacement	1500
E	Minimal Labels	2300
F	String Compression	2400
G	Tree Queries	2500

Educational Codeforces Round 25