#include<bits/stdc++.h>

#pragma GCC optimize("unroll-loops")
using namespace std;

#define ll long long
#define rep(i,n,N) for(int i = n; i<=N; ++i)
#define rap(i,n,N) for(int i = n; i>=N; --i)
#define For(i,n,N) for(int i = n; i< N; ++i)
#define rip(i,n,N,V) for(int i = n; i<=N; i+=V)
#define debug(x) cout << ">> " << #x <<" = " << x << endl
#define out(x,y) cout << "<> " << x << " " << y << endl
#define fi first
#define se second
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define vi vector<int>
#define pii pair<int,int>
#define ari(x) array<int,x>
#define arll(x) array<ll,x>
#define mems(x,y) memset(x,y,sizeof x)
#define rsort(x) sort(all(x)), reverse(all(x))
#define all(x) x.begin(),x.end()
#define endl '\n'

const int MAX = 3e2 + 5;
const int dr[] = {0,0,1,-1,1,1,-1,-1};
const int dc[] = {1,-1,0,0,1,-1,1,-1};

int n,cs[MAX][MAX][MAX],dp[MAX][MAX],ans;
string s;

int f(int ls,int nw){
	if(nw==n)return 0;
	int &ret = dp[ls][nw];
	if(ret!=-1)return ret;
	ret = 1e9;
	For(i,nw,n)ret = min(ret, f(nw, i+1) + cs[nw][ls][i] + 1);
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin>>s;
	n = s.size();
	mems(dp, -1);
	For(i,1,n){
		rap(j,i-1,0)cs[i][j][i-1] = i-j;
		For(k,i,n){
			cs[i][i][k] = k-i+1;
			rap(j,i-1,0){
				cs[i][j][k] = min({cs[i][j+1][k]+1, cs[i][j][k-1]+1, cs[i][j+1][k-1]+(s[j]!=s[k])});
			}
		}
	}
	ans = 1e9;
//	debug(n);
//	debug(cs[4][0][7]);
//	debug(cs[8][4][11]);
//	debug(cs[12][8][15]);
//	debug(f(0,4));
//	debug(f(4,8));
//	debug(f(8,12));
//	rep(i,1,n)out(i, f(0,i) + i);
	rep(i,1,n)ans = min(ans, f(0,i) + i + 1);
	cout<<ans<<endl;
	return 0;
}