IOIPALIN - Palindrome 2000

A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal number of characters to be inserted into the string in order to obtain a palindrome. As an example, by inserting 2 characters, the string "Ab3bd" can be transformed into a palindrome ("dAb3bAd" or "Adb3bdA"). However, inserting fewer than 2 characters does not produce a palindrome.

Input

The first line contains one integer: the length of the input string N, 3 ≤ N ≤ 5000. The second line contains one string with length N. The string is formed from uppercase letters from ‘A’ to ‘Z’, lowercase letters from ‘a’ to ‘z’ and digits from ‘0’ to ‘9’. Uppercase and lowercase letters are to be considered distinct.

Output

The first line contains one integer, which is the desired minimal number.

Example

Input:
5
Ab3bd

Output:
2

Added by:Gareev
Date:2010-08-16
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS OBJC PERL6 VB.NET
Resource:IOI 2000, Day 1

hide comments
2017-09-20 09:22:12
don't write anything extra and O(n*n) space complexity gives AC :)
2017-06-27 21:10:58
recursion..!!!
2017-06-23 23:15:57
Just use scanf printf without space optimization it also passes
2017-06-07 21:31:21
who says time limit is strict ?
similar with lcs . O(n^2) dp is passing , but do take care of space complexity :)
easy one . :)
2017-06-06 07:06:46
NEEDS Space Optimisation..!!
2017-03-04 00:13:28
cin/cout; string; 0.17-0.19s AC

Quit blaming the frameworks and optimize your implementation!
2017-01-28 10:34:07
Too strict Time limit..
2017-01-26 14:06:15
Too strict time limit.
Same optimized code in java didn't get ac which in c++ did. :(
2016-12-21 19:52:57
space O(N^2) gets accepted with fast I/P in C++..
2016-10-28 23:51:20
Too strict time constraints :/ long long int : TLE, int : AC
Also space optimization required
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.