Problem Statement

Minimum Insertions to Make a String Palindrome Given a string `S`, find the minimum number of characters that must be inserted anywhere in the string so that it becomes a palindrome. Input Format The only line contains `S`. Output Format Print the minimum number of insertions. Constraints `1 <= |S| <= 5000`. `S` contains lowercase English letters. Notes An insertion may be made at any position. You do not need to print the resulting palindrome.