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 = 'from collections import Counter\nimport sys\ns = input()\nN = len(s)\nsc = Counter(s)\nodds = [1 for x in sc if sc[x] % 2 == 1]\nif len(odds) > 1:\n    print((-1))\n    return\n\nclass BIT:\n    def __init__(self, size):\n        self.bit = [0] * (size+1)\n    def add(self, index, elem):\n        index += 1\n        while index < len(self.bit):\n            self.bit[index] += elem\n            index += index & -index\n    def get(self, index):\n        index += 1\n        ret = 0\n        while 0 < index:\n            ret += self.bit[index]\n            index -= index & -index\n        return ret\n\nindices = [-1] * N\ntb = {c: [None] * (sc[c]//2) for c in sc}\nlens = {c: 0 for c in sc}\np = 0\nfor i in range(N):\n    c = s[i]\n    l = lens[c]\n    if 2 * (l+1) <= sc[c]:\n        indices[p] = i\n        tb[c][l] = p\n        lens[c] += 1\n        p += 1\n    elif 2 * (l+1) == sc[c] + 1:\n        indices[N//2] = i\n        lens[c] += 1\n    else:\n        indices[N-1-tb[c][sc[c]-l-1]] = i\n        lens[c] += 1\n\nans = 0\nbit = BIT(N)\nfor i in indices:\n    bit.add(i, 1)\n    ans += bit.get(N-1) - bit.get(i)\nprint(ans)\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: