#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
#define N 61

using namespace std;
typedef long long llg;

char s[N];
int f[N][N][2];

bool pd(int l,int r){
	for(int i=l,j=r;i<r;i++,j++)
		if(s[i]!=s[j]) return 0;
	return 1;
}

int gi(int l,int r,bool w);
int dfs(int l,int r,bool w){
	if(f[l][r][w]) return f[l][r][w];
	int now=r-l+1,mid=(l+r+1)>>1;
	for(int i=l+1;i<=mid;i++)
		if(pd(l,i)) now=min(now,dfs(l,i-1,0)+gi(i*2-l,r,w)+1);
	if(w) for(int i=l+1;i<=r;i++) now=min(now,dfs(l,i-1,1)+gi(i,r,1));
	return f[l][r][w]=now;
}

int gi(int l,int r,bool w){
	if(l>r) return 0; int now=r-l+1;
	if(w) now=min(now,dfs(l,r,1)+1);
	return now;
}

int main(){
	File("a");
	scanf("%s",s+1);
	printf("%d",dfs(1,strlen(s+1),1));
	return 0;
}