///////////////////////////////////////////////////////////////////////////////

#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <typeinfo>
#include <numeric>
#include <cassert>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define pb push_back
#define V vector
#define M unordered_map
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define ALL(a) (a).begin(),(a).end()

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;

struct UnionFind
{
        ull *parent, *count, *rank;

        UnionFind(ull n) {
                parent = new ull[n+1];
                count = new ull[n+1];
                rank = new ull[n+1];
                for (ull i = 0ULL; i < n+1; ++i) {
                        parent[i] = i;
                        count[i] = 1;
                        rank[i] = 0;
                }
        }

        ull root(ull i) {
                if (parent[i] == i) return i;
                parent[i] = root(parent[i]);
                return parent[i];
        }

        void unite(ull i, ull j) {
                ull rooti = root(i);
                ull rootj = root(j);

                if (rooti == rootj) return;

                if (rank[rootj] < rank[rooti]) {
                        parent[i] = parent[j] = parent[rootj] = rooti;
                        count[rooti] += count[rootj];
                }
                else {
                        parent[i] = parent[j] = parent[rooti] = rootj;
                        count[rootj] += count[rooti];
                        if (rank[rootj] == rank[rooti]) rank[rootj]++;
                }
        }

        bool same(ull i, ull j) {
                return root(i) == root(j);
        }
};

struct BIT
{
        ll *tree;
        ll size;

        BIT(ll n, ll init) {
                tree = new ll[n+1];
                size = n;
                rep (i, n+1) tree[i] = init;
        }

        // idx is 1 origin
        void add(ll idx, ll x) {
                assert(idx > 0LL);
                while (idx <= size) {
                        tree[idx] += x;
                        idx += (idx & (-idx));
                }
        }

        // idx is 1 origin
        ll sum(ll idx) {
                assert(idx > 0LL);
                ll ret = 0LL;
                while (idx > 0LL) {
                        ret += tree[idx];
                        idx -= (idx & (-idx));
                }
                return ret;
        }
};

void llin(ll &a)
{
        cin >> a;
}

void llinl1(auto &v, ll count)
{
        for (ll i = 0LL; i < count ; ++i) {
                ll a;
                cin >> a;
                v.push_back(a);
        }
}

void llinl2(auto &v, ll count)
{
        for (ll i = 0LL; i < count ; ++i) {
                ll a, b;
                cin >> a >> b;
                v.push_back(tuple<ll, ll>(a, b));
        }
}

void llinl3(auto &v, ll count)
{
        for (ll i = 0LL; i < count ; ++i) {
                ll a, b, c;
                cin >> a >> b >> c;
                v.push_back(tuple<ll, ll, ll>(a, b, c));
        }
}

void llina(auto &v, ll count)
{
        llinl1(v, count);
}

template <typename T>
T min(const V<T> v)
{
        T ret = v[0];
        for (auto i : v) ret = min(ret, i);
        return ret;
}

template <typename T>
T max(const V<T> v)
{
        T ret = v[0];
        for (auto i : v) ret = max(ret, i);
        return ret;
}

ll absll(ll x)
{
        if (x < 0) return -x;
        return x;
}

ll mod_mlt(ll x, ll y, ll mod)
{
        ll ret = 0LL;
        x %= mod;

        while (y) {
                if (y & 1LL) {
                        ret += x;
                        ret %= mod;
                }
                y >>= 1;
                x <<= 1;
                x %= mod;
        }

        return ret;
}

ll mod_pow(ll base, ll exp, ll mod)
{
        ll ret = 1LL;

        for ( ; exp; ) {
                if (exp & 1LL) {
                        ret *= base;
                        ret %= mod;
                }
                base = (base * base) % mod;
                exp >>= 1;
        }

        return ret;
}

ll mod_inv(ll x, ll mod)
{
        // available only when mod is prime
        return mod_pow(x, mod - 2LL, mod);
}

ll gcm(ll x, ll y)
{
        while (y != 0) {
                ll z = x % y;
                x = y;
                y = z;
        }
        return x;
}

template <typename T>
void sort(V<T> &v)
{
        sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
        sort(v.begin(), v.end(), greater<T>());
}

void get_divisors(V<ll> &retlist, ll x)
{
        for (ll i = 1LL; i < sqrt(x) + 3LL; ++i) {
                if (x % i == 0LL) {
                        retlist.push_back(i);
                        retlist.push_back(x / i);
                }
        }
}

void get_factors(V<ll> &retlist, ll x)
{
        for (ll i = 2LL; i < (ll)(sqrt(x)) + 3LL; ++i) {
                while (x % i == 0LL) {
                        retlist.pb(i);
                        x /= i;
                }
        }
        retlist.pb(x);
}

template <typename T>
void intersection(const set<T> &a, const set<T> &b,
                  set<T> &result)
{
        V<T> resultlist;

        set_intersection(a.begin(), a.end(),
                         b.begin(), b.end(),
                         back_inserter(resultlist));

        set<T> resultset(resultlist.begin(), resultlist.end());
        result = resultset;
}

ull combination(ll x, ll y)
{
        if (y > x / 2LL) y = x - y;

        ull ret = 1LL;
        for (ll i = 0LL; i < y; ++i) {
                ret *= x--;
                ret /= (i + 1LL);
        }

        return ret;
}

ull mod_combination(ll x, ll y, ll mod)
{
        if (y > x / 2LL) y = x - y;

        ll ret = 1;

        for (ll i = 0LL; i < y; ++i) {
                ret = (ret * x--) % mod;
                ret = (ret * mod_inv(i + 1LL, mod)) % mod;
        }

        return ret;
}

void make_linklist(const V<tuple<ll, ll>> &srclist, V<V<ll>> &dstlist)
{
        for (auto src : srclist) {
                ll a = get<0>(src);
                ll b = get<1>(src);
                dstlist[a].pb(b);
                dstlist[b].pb(a);
        }
}

void debug_print(auto xlist)
{
        for (auto x : xlist) cout << "-- " << x << endl;
}

int _main();
int main()
{
        cout << setprecision(12);
        return _main();
}

///////////////////////////////////////////////////////////////////////////////

void alp_countup(ll *counts, char c)
{
        counts[c - 'a']++;
}


ll alp_getcount(ll *counts, char c)
{
        return counts[c - 'a'];
}

ll alp_oddcounts(ll *counts)
{
        ll ret = 0LL;
        rep (i, 26) {
                if (counts[i] & 1LL) ret++;
        }
        return ret;
}

char alp_odd(ll *counts)
{
        rep (i, 26) {
                if (counts[i] & 1LL) return ((char)i) + 'a';
        }
}

void alp_pospush(V<ll> *poslist, char c, ll idx)
{
        poslist[c - 'a'].pb(idx);
}

V<ll> *alp_posget(V<ll> *poslist, char c)
{
        return &(poslist[c - 'a']);
}

int _main()
{
        string s;
        cin >> s;

        ll slen = s.size();

        ll alp_counts[26];
        rep (i, 26) alp_counts[i] = 0LL;

        for (auto c : s) alp_countup(alp_counts, c);

        ll oddcounts = alp_oddcounts(alp_counts);

        if (slen & 1LL) {
                if (oddcounts != 1) {
                        cout << -1;
                        return 0;
                }
        }
        else {
                if (oddcounts != 0) {
                        cout << -1;
                        return 0;
                }
        }

        ll ans = 0LL;

        char *lefts = new char[slen/2];
        ll lefts_count = 0LL;
        ll alp_moved[26];
        rep (i, 26) alp_moved[i] = 0LL;
        ll skipped = 0LL;

        rep (i, slen) {
                char c = s[i];
                ll orig = alp_getcount(alp_counts, c);
                ll moved = alp_getcount(alp_moved, c);
                if (moved < orig / 2) {
                        ans += skipped;
                        lefts[lefts_count++] = c;
                        alp_countup(alp_moved, c);
                        s[i] = 0;
                        if (lefts_count >= slen/2) break;
                }
                else {
                        skipped++;
                }
        }

        skipped = 0LL;

        if (slen & 1LL) {
                char odd = alp_odd(alp_counts);
                rep (i, slen) {
                        if (s[i] != 0) {
                                if (s[i] == odd) {
                                        ans += skipped;
                                        s[i] = 0;
                                        break;
                                }
                                else skipped++;
                        }
                }
        }

        V<ll> alp_poslist[26];
        rep (i, slen/2) alp_pospush(alp_poslist, lefts[slen/2-i-1], i);

        ll alp_poslist_idx[26];
        rep (i, 26) alp_poslist_idx[i] = 0LL;

        ll *rights = new ll[slen/2];
        ll idx = 0LL;
        for (auto c : s) {
                if (c != 0) {
                        rights[idx++] = (*alp_posget(alp_poslist, c))[alp_poslist_idx[c - 'a']++] + 1;
                }
        }

        BIT b(slen/2, 0);
        rep (i, slen/2) {
                ans += (b.sum(slen/2) - b.sum(rights[i]));
                b.add(rights[i], 1);
        }

        cout << ans;



        return 0;
}

///////////////////////////////////////////////////////////////////////////////


Measured memory_bytes: 3448