Problem:
Score : 400 points

Problem Statement

We have a string s consisting of lowercase English letters.
Snuke can perform the following operation repeatedly:

Insert a letter x to any position in s of his choice, including the beginning and end of s.

Snuke's objective is to turn s into a palindrome.
Determine whether the objective is achievable. If it is achievable, find the minimum number of operations required.

Notes

A palindrome is a string that reads the same forward and backward.
For example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.

Constraints

1 \leq |s| \leq 10^5

s consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

s

Output

If the objective is achievable, print the number of operations required.
If it is not, print -1 instead.

Sample Input 1

xabxa

Sample Output 1

2

One solution is as follows (newly inserted x are shown in bold):

xabxa → xaxbxa → xaxbxax

Sample Input 2

ab

Sample Output 2

-1

No sequence of operations can turn s into a palindrome.

Sample Input 3

a

Sample Output 3

0

s is a palindrome already at the beginning.

Sample Input 4

oxxx

Sample Output 4

3

One solution is as follows:

oxxx → xoxxx → xxoxxx → xxxoxxx

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

def is_palindrome(s)
  (s.size / 2).times do |i|
    return false if s[i] != s[(s.size - 1) - i]
  end

  return true
end

def main(argv)
  s = gets.chomp

  t = ''
  s.size.times{ |i| t += s[i] if s[i] != 'x' }

  unless is_palindrome(t) then
    puts (-1).to_s
    return
  end

  m = t.size / 2
  m += 1 if t.size % 2 == 1

  c = 0
  k1 = -1
  0.upto(s.size - 1).each do |i|
    if s[i] != 'x' then
      c += 1
      k1 = i
      break if c == m
    end
  end

  c = 0
  k2 = -1
  (s.size - 1).downto(0).each do |i|
    if s[i] != 'x' then
      c += 1
      k2 = i
      break if c == m
    end
  end

  v = [0]
  0.upto(k1).each do |i|
    if s[i] != 'x' then
      v.push(0)
    else
      v[v.size - 1] += 1
    end
  end

  u = [0]
  (s.size - 1).downto(k2).each do |i|
    if s[i] != 'x' then
      u.push(0)
    else
      u[u.size - 1] += 1
    end
  end

  s = 0
  v.size.times do |i|
    s += (v[i] - u[i]).abs
  end
  puts s.to_s
end

if self.to_s == 'main' then
  main(ARGV)
end