Problem: 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, s1, c2, s2, ..., ck, sk, 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| + |s1| + |c2| + |s2|... |ck| + |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.

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: 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 8005;
char str[N], s[N];
int n, nxt[N], dp[N];
int main() {
  memset(dp, 63, sizeof(dp));
  scanf("%s", str), n = strlen(str);
  for (int k = 0; k < n; k++) {
    for (int j = k; j < n; j++) s[j - k] = str[j];
    int i = 0, j = -1;
    nxt[0] = -1;
    while (i <= n - k) {
      while (j != -1 && s[i] != s[j]) j = nxt[j];
      nxt[++i] = ++j;
    }
    for (int i = k; i < n; i++) {
      int now = (i - k + 1) - nxt[i - k + 1], res, cnt = 0;
      res = (i - k + 1) % now == 0 ? (i - k + 1) / now : 1;
      if (res == 1) {
        if (k == 0)
          dp[i] = min(dp[i], i - k + 2);
        else
          dp[i] = min(dp[i], dp[k - 1] + i - k + 2);
      } else {
        int NOW = res;
        while (NOW) NOW /= 10, cnt++;
        if (k == 0)
          dp[i] = min(dp[i], now + cnt);
        else
          dp[i] = min(dp[i], dp[k - 1] + now + cnt);
      }
    }
  }
  printf("%d\n", dp[n - 1]);
  return 0;
}