#include<bits/stdc++.h>
using namespace std;

char s[105];
int f[105][105][2], n;

bool check(int l, int r) {
    int mid = (l + r)/2, len = r - l + 1;
    if(len%2 != 0) return 0;
    for(int p = l; p <= mid; p++)
        if(s[p] != s[p + len/2]) return 0;
    return 1;
}

int main() {
    cin>>(s + 1);
    n = strlen(s + 1);
    for(int L = 1; L <= n; L++) {
        for(int i = 1; i + L - 1 <= n; i++) {
            int j = i + L - 1;
            f[i][j][0] = f[i][j][1] = L;
            for(int k = i; k < j; k++)
                f[i][j][0] = min(f[i][j][0], f[i][k][0] + j - k);
            for(int k = i; k < j; k++)
                f[i][j][1] = min(f[i][j][1], min(f[i][k][1], f[i][k][0]) + min(f[k + 1][j][0], f[k + 1][j][1]) + 1);
            if(check(i, j)) f[i][j][0] = min(f[i][j][0], f[i][i + L/2 - 1][0] + 1);
        }
    }
    cout<<min(f[1][n][0], f[1][n][1])<<endl;
    return 0;
}