#include<bits/stdc++.h>
#define rep(i,l,r) for (register int i(l), i##end(r); i <= i##end; ++i)
#define per(i,r,l) for (register int i(r), i##end(l); i >= i##end; --i)
#define LL long long
using namespace std;

template <typename T>
inline void read(T &x) {
	x = 0; bool f = 0; char ch = getchar();
	while (ch < '0' || ch > '9') {
		f ^= ch == '-';
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') {
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	if (f) x = -x;
}

template <typename Tx, typename ...Ty>
inline void read(Tx &x, Ty &...y) {
	read(x);
	read(y...);
}

template <typename T>
inline void cmin(T &x, T y) {
	if (x > y) x = y;
}

const int N = 309;

int n;
int f[N][N], g[N][N][N];
char s[N];

int main() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	memset(f, 0x3f, sizeof(f));
	rep (i, 1, n) {
		f[i][0] = i + 1;
	}
	memset(g, 0x3f, sizeof(g));
	rep (j, 1, n - 1) {
		g[j][j][j] = 0;
		rep (i, j, n) {
			per (k, j, 0) {
				if (i != j) {
					cmin(g[i][j][k], g[i - 1][j][k] + 1);
				}
				if (j != k) {
					cmin(g[i][j][k], g[i][j][k + 1] + 1);
				}
				if (i != j && j != k) {
					cmin(g[i][j][k], g[i - 1][j][k + 1] + (s[i] != s[k + 1]));
				}
			}
		}
	}
	rep (i, 1, n) {
		rep (j, 1, i - 1) {
			rep (k, 0, j - 1) {
				cmin(f[i][j], f[j][k] + g[i][j][k] + 1);
			}
		}
	}
	int ans = n + 1;
	rep (j, 0, n) {
		cmin(ans, f[n][j]);
	}
	printf("%d\n", ans);
	return 0;
}