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

using ll  = long long;
using pii = pair<int, int>;

#define fi       first
#define se       second
#define All(x)   x.begin(), x.end()
#define debug(x) cout << #x << " = " << (x) << '\n';

const int iINF = 1'000'000'000;
const ll INF   = 1'000'000'000'000'000'000;

const int maxN  = 303;

int N;
string S;
int cost[maxN][maxN][maxN];
int dp[maxN][maxN];

int ccost(int l, int m, int r) {
    if (l < 1 || l > N+1) return iINF;
    if (m < 0 || m > N) return iINF;
    if (r < 0 || r > N) return iINF;
    if (l > m+1 || r < m) return iINF;

    int &ret = cost[l][m][r];

    if (ret != -1) return ret;
    if ((l == m+1) && (m == r)) return ret = 0;

    ret = min({
        iINF,
        ccost(l+1, m, r) + 1,
        ccost(l, m, r-1) + 1
    });
    ret = min(ret, ccost(l+1, m, r-1) + (S[l] != S[r]));

    return ret;
}

int cdp(int l, int r) {
    int &ret = dp[l][r];

    if (ret != -1) return ret;
    if (l == 1) return ret = r + 1;

    ret = iINF;
    for (int prv = 1; prv < l; prv++) {
        ret = min(ret, cdp(prv, l-1) + ccost(prv, l-1, r) + 1);
    }

    // cout << "cdp(" << l << ", " << r << ") = " << ret << '\n';
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    cin >> S;
    N = S.length();
    S = "#" + S + "#";

    memset(cost, -1, sizeof cost);
    memset(dp, -1, sizeof dp);

    // for (int m = 0; m <= N; m++) {
    //     for (int l = 0; l <= m+1; l++) {
    //         for (int r = m; r <= N; r++) {
    //             ccost(l, m, r);
    //         }
    //     }
    // }

    int ans = iINF;
    for (int l = 1; l <= N; l++) ans = min(ans, cdp(l, N));
    cout << ans << '\n';
}