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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int pp[305][305][305];
int dp[305][305];
signed main() {
	cin.tie(0)->sync_with_stdio(0);
	string s;
	cin >> s;
	int n = s.size();
	s = " " + s;
	vector<vector<int>>res(n+1,vector<int>(n+1));
	for(int i = 2; i<=n; i++){
		vector<char>a(n+1);
		vector<char>b(n+1);
		for(int j = i-1; j>=1; j--){
			a[i-j] = s[j];
		}
		for(int j = i; j<=n; j++){
			b[j-i+1] = s[j];
		}
		for(int i = 1; i<=n; i++){
			res[0][i] = res[i][0] = i;
		}
		for(int x = 1; x<=n; x++){
			for(int y = 1; y<=n; y++){
				if(a[x] == b[y]){
					res[x][y] = min({res[x-1][y-1],res[x-1][y]+1,res[x][y-1]+1});
				}
				else{
					res[x][y] = min({res[x-1][y-1],res[x-1][y],res[x][y-1]}) + 1;
				}
			}
		}
		for(int x = 1; x<i; x++){
			for(int y = 1; y<=n+1-i; y++){
				pp[i-x][i][i+y-1] = res[x][y];
			}
		}
	}
	for(int i = 1; i<=n; i++){
		dp[1][i] = i+1;
	}
	for(int i = 2; i<=n; i++){
		for(int j = i; j<=n; j++){
			dp[i][j] = 1e9;
			for(int k = 1; k<i; k++){
				dp[i][j] = min(dp[i][j],dp[k][i-1] + pp[k][i][j]+1);
			}
		}
	}
	int ans = 1e9;
	for(int i = 1; i<=n; i++){
		ans = min(ans,dp[i][n]);
	}
	// for(int i = 1; i<=n; i++){
	// 	for(int j = i; j<=n; j++){
	// 		cout << i << ' ' << j << ' ' << dp[i][j] << '\n';
	// 	}
	// }
	cout << ans << '\n';
	return 0;
}