CodeForces 176B

#include <bits/stdc++.h>

using namespace std;

int dp[5555][5555];

signed main() {
    int n__;
    cin >> n__;
    string s;
    cin >> s;
    string t = s;
    reverse (t.begin(), t.end());
    int n = s.length();
    for (int i = n; i; i --) s[i] = s[i - 1];
    for (int i = n; i; i --) t[i] = t[i - 1];
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= n; j ++)
            if (s[i] == t[j])
                dp[i][j] = dp[i - 1][j - 1] + 1;
            else
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
    cout << n - dp[n][n] << '\n';
    return 0;
}