#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector< vector <int> > vvi;
typedef pair<int, int> pii;
typedef pair < pair < int, int >, int > piii;
typedef pair < pair <int, int > , pair <int, int> > piiii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
 
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define RFOR(i,a,b) for(int i = a-1; i >= b; i --)
#define all(a) a.begin(), a.end()
#define endl '\n';
#define sz(x) (int)(x).size()
 
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
 
template <typename T>
void pr(vector<T> &v) {
    FOR(i, 0, sz(v)) cout << v[i] << " ";
    cout << endl;
}
template <typename T>
void pr(vector<vector<T> > &v) {
    FOR(i, 0, sz(v)) { pr(v[i]); }
}
template <typename T>
void re(T &x) {
    cin >> x;
}
template <typename T>
void re(vector<T> &a) {
    FOR(i, 0, sz(a)) re(a[i]);
}
template <class Arg, class... Args>
void re(Arg &first, Args &... rest) {
    re(first);
    re(rest...);
}
template <typename T>
void pr(T x) {
    cout << x << endl;
}
template <class Arg, class... Args>
void pr(const Arg &first, const Args &... rest) {
    cout << first << " ";
    pr(rest...);
    cout << endl;
}
void ps() { cout << endl; }
template<class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
    cout << t; if (sizeof...(ts)) cout << " "; ps(ts...);
}
 
const ll MOD  =  998244353;
#define inf 1e18;
#define INF INT_MAX

long double PI = 4*atan(1);
long double eps = 1e-12;

int dp[100][2] = {};
int n;
string s;

int recurse(int idx, int diff) {
    if(dp[idx][diff] != -1) return dp[idx][diff];

    if(idx == (n-2)/2) {
        dp[idx][diff] = diff;
        return diff;
    }

    if(diff == 0) {
        int ndiff = (s[idx + 1] != s[n-2-idx]);
        int v1 = recurse(idx + 1, ndiff);
        int v2 = 1e9;
        int v3 = 1e9;
        if(ndiff) {
            v2 = 2 + recurse(idx + 1, 0);
            v3 = 2 + recurse(idx + 1, 1);
        }
        dp[idx][diff] = min({v1, v2, v3});
    } else {
        int ndiff = (s[idx + 1] != s[n-2-idx]);
        int v1 = 1e9;
        int v2 = 1e9;
        if(ndiff) {
            v1 = 1 + recurse(idx + 1, 0);
            v2 = 1 + recurse(idx + 1, 1);
        } else {
            v1 = 1 + recurse(idx + 1, 1);
            v2 = 2 + recurse(idx + 1, 0);
        }
        dp[idx][diff] = min(v1, v2);
    }
    return dp[idx][diff];
}


int main() {
    //auto start = chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);cin.tie(0);
    // ofstream cout("disrupt.out");
    // ifstream cin("disrupt.in");
    #ifdef DEBUG
      freopen("input.txt", "r", stdin);
      freopen("output.txt", "w", stdout);
    #endif 
    
     cin >> s;
    n = s.length();
    FOR(i,0,100) FOR(j,0,2) dp[i][j] = -1;



    int diff = (s[0] != s[n-1]);


    recurse(0, diff);

    cout << dp[0][diff] << endl;



    

    // auto stop = chrono::high_resolution_clock::now();
    // auto duration = chrono::duration_cast<chrono::microseconds>(stop - start);
    // cout << duration.count() << endl;
    //cin.close();
    //cout.close();
}