You are given a string S consisting of lowercase English letters.
Determine whether we can turn S into a palindrome by repeating the operation of swapping two adjacent characters. If it is possible, find the minimum required number of operations.

-----Constraints-----
 - 1 \leq |S| \leq 2 × 10^5
 - S consists of lowercase English letters.

-----Input-----
Input is given from Standard Input in the following format:
S

-----Output-----
If we cannot turn S into a palindrome, print -1. Otherwise, print the minimum required number of operations.

-----Sample Input-----
eel

-----Sample Output-----
1

We can turn S into a palindrome by the following operation:
 - Swap the 2-nd and 3-rd characters. S is now ele.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class BIT:\n    def __init__(self, n):\n        self.n = n\n        self.bit = [0] * (n + 1)\n\n    def _sum(self, i):\n        s = 0\n        while i > 0:\n            s += self.bit[i]\n            i -= i & -i\n        return s\n\n    def add(self, i, val):\n        """i番目にvalを加える"""\n        i = i + 1\n        while i <= self.n:\n            self.bit[i] += val\n            i += i & -i\n\n    def get_sum(self, l, r):\n        """区間[l, r)の和を求める"""\n        return self._sum(r) - self._sum(l)\n \n\ndef swap_time(array0, array1):\n    n = len(array0)\n    memo = {}\n    for i in range(n)[::-1]:\n        if array0[i] not in memo:\n            memo[array0[i]] = []\n        memo[array0[i]].append(i)\n    res = []\n    for val in array1:\n        ind = memo[val].pop()\n        res.append(ind)\n    \n    bit = BIT(n)\n    ans = 0\n    for i in range(n):\n        bit.add(res[i], 1)\n        ans += bit.get_sum(res[i] + 1, n)\n    return ans\n  \n  \n\nALPH = "abcdefghijklmnopqrstuvwxyz"\ns = input()\n\ncnt_memo = {}\nfor char in s:\n    if char not in cnt_memo:\n        cnt_memo[char] = 1\n    else:\n        cnt_memo[char] += 1\n\nodd = ""\nfor char in cnt_memo:\n    if cnt_memo[char] % 2 == 1:\n        if odd:\n            print(-1)\n            return\n        else:\n            odd = char\n            cnt_memo[char] -= 1\n            cnt_memo[char] //= 2\n    else:\n        cnt_memo[char] //= 2\n\nleft = []\nmid = []\nif odd:\n    mid = [odd]\nright = []\nfor char in s:\n    if odd == char and cnt_memo[char] == 0:\n        odd = ""\n    elif cnt_memo[char] != 0:\n        left.append(char)\n        cnt_memo[char] -= 1\n    else:\n        right.append(char)\n\nans = 0\nans += swap_time(left + mid + right, list(s))\nans += swap_time(left, right[::-1])\nprint(ans)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: