Swapping to Palindrome

You are given a string $S$ with length $N$ and you should change it to a palindrome using a sequence of zero or more operations. In one operation, you should choose two adjacent elements of $S$ (two characters) and swap them; however, neither of these elements may be used in any other operation. Find the minimum number of operations you have to perform in order to change the string $S$ into a p