#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, -1, 0, 1, -1, 1};
int dj[] = {1, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 998244353;
const int N = 302, M = 1e6 + 5;
const ld PI = acos(-1.0), EPS = 1e-9;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int n, dp1[N][N][N], dp2[N][N];
string s;

int solve(int l, int mid, int r) {
    if (l == mid) return r - mid + 1;
    if (r == mid - 1) return mid - l;
    int &ret = dp1[l][mid][r];
    if (~ret) return ret;
    if (s[l] == s[r]) return ret = solve(l + 1, mid, r - 1);
    ret = 1e9;
    ret = min(ret, 1 + solve(l + 1, mid, r - 1));
    ret = min(ret, 1 + solve(l, mid, r - 1));
    ret = min(ret, 1 + solve(l + 1, mid, r));
    return ret;
}

int solve2(int l, int r) {
    if (r == n) return 0;
    int &ret = dp2[l][r];
    if (~ret) return ret;
    ret = 1e9;
    for (int i = r; i < n; i++) {
        ret = min(ret, 1 + solve(l, r, i) + solve2(r, i + 1));
    }
    return ret;
}

//#define endl '\n'
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("farm.in", "r", stdin);
    memset(dp1, -1, sizeof dp1);
    memset(dp2, -1, sizeof dp2);
    cin >> s;
    n = s.length();
    cout << solve2(0, 0);
    return 0;
}