Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

F. String Compression

time limit per test

2 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputIvan 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*_{1}, *s*_{1}, *c*_{2}, *s*_{2}, ..., *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*_{1} exactly *a*_{1} times, then string *s*_{2} exactly *a*_{2} times, and so on, the result will be string *s*.

The length of a compressed version is |*c*_{1}| + |*s*_{1}| + |*c*_{2}| + |*s*_{2}|... |*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*.

Examples

Input

aaaaaaaaaa

Output

3

Input

abcab

Output

6

Input

cczabababab

Output

7

Note

In the first example Ivan will choose this compressed version: *c*_{1} is 10, *s*_{1} is a.

In the second example Ivan will choose this compressed version: *c*_{1} is 1, *s*_{1} is abcab.

In the third example Ivan will choose this compressed version: *c*_{1} is 2, *s*_{1} is c, *c*_{2} is 1, *s*_{2} is z, *c*_{3} is 4, *s*_{3} is ab.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/18/2017 05:55:35 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|