#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 300 + 5;
const int OO = 1e9;

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

int edit_distance(int a, int p, int b) {
    if (a >= p && b < p) {
        return 0;
    } else if (a >= p) {
        return b - p + 1;
    } else if (b < p) {
        return p - a;
    }
    auto &ret = dp2[a][p][b];
    if (ret != -1) {
        return ret;
    }
    ret = (s[a] != s[b]) + edit_distance(a + 1, p, b - 1);
    ret = min(ret, 1 + edit_distance(a + 1, p, b));
    ret = min(ret, 1 + edit_distance(a, p, b - 1));
    return ret;
}

int solve(int a, int b) {
    if (b + 1 == s.size()) {
        return 0;
    }
    auto &ret = dp[a][b];
    if (ret != -1) {
        return ret;
    }
    ret = OO;
    for (int i = b + 1; i < n; ++i) {
        ret = min(ret, edit_distance(a, b + 1, i) + 1 + solve(b + 1, i));
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> s;
    n = s.size();
    int ans = OO;
    memset(dp, -1, sizeof dp);
    memset(dp2, -1, sizeof dp2);
    for (int i = 0; i < n; ++i) {
        ans = min(ans, i + 2 + solve(0, i));
    }
    cout << ans << '\n';
    return 0;
}