#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
#include<array>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int,int>;
using piii = pair<pii,int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void in(void){return;}
template <typename First, typename... Rest> void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}
inline void out(void){cout << "\n";return;}
template <typename First, typename... Rest> void out(First first, Rest... rest){cout << first << " ";out(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
}
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
    os << p.first << " " << p.second;
    return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template <typename T> void Exit(T first){cout << first << endl;exit(0); };
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1,0), pii(0, 1), pii(-1, 0), pii(0, -1)};

template< typename T >
struct BinaryIndexedTree {
  vector< T > data;

  BinaryIndexedTree(int sz) {
    data.assign(++sz, 0);
  }

  T sum(int k) {
    T ret = 0;
    for(++k; k > 0; k -= k & -k) ret += data[k];
    return (ret);
  }

  void add(int k, T x) {
    for(++k; k < data.size(); k += k & -k) data[k] += x;
  }
};

ll inv_num(vector<int> a){
    int n = a.size();
    ll ans = 0;
    vector<pair<int,int> > T(n);
    rep(i, 0, n) T[i] = make_pair(a[i], i);
    stable_sort(ALL(T));
    vector<int> X(n);
    rep(i, 0, n) X[T[i].second] = i; 
    BinaryIndexedTree<int> bit(n);
    for(int i = 0; i < n; i++){
        ans += i - bit.sum(X[i]);
        bit.add(X[i], 1);
    }
    return ans;
}

int main(){
    iosetup();
    string S; cin >> S;
    map<char, int> M;
    int N = S.size();
    vector<int> C(N, 0), X(N, 0);
    string A, B, D;
    rep(i, 0, N){
        M[S[i]]++;
        C[i] = M[S[i]];
    }
    int cnt = 0;
    for(auto e: M) if(e.second % 2 == 1) cnt++;
    if(cnt >= 2) Exit(-1);
    rep(i, 0, N){
        if(M[S[i]]%2==0){
            if(C[i] <= M[S[i]] / 2) X[i] = -1;
            else X[i] = 1;
        }else{
            if(C[i] <= M[S[i]] / 2) X[i] = -1;
            else if(C[i] ==( M[S[i]] + 1 ) / 2) X[i] = 0;
            else X[i] = 1;
        }
    }
    vector<int> P(N, 0);
    int idx = 0, ridx = N - 1;
    rep(i, 0, N){
        if(X[i] == -1) P[i] = idx++;
        if(X[i] == 0) P[i] = (N - 1) / 2;
    }
    rrep(i, 0, N) if(X[i] == 1) P[i] = ridx--;

    rep(i, 0, N){
        if(X[i] == -1) A += S[i];
        else if(X[i] == 0) B += S[i];
        else D += S[i];
    }
    ll ans = 0;
    ans += inv_num(P);
    // cerr << ans << endl;
    // cerr << A << " " << D << endl;
    reverse(ALL(D));
    map<char, vector<int> > MP;
    map<char, int> idxs;
    vector<int> Q(A.size());
    rep(i, 0, A.size()) MP[A[i]].push_back(i);
    rep(i, 0, D.size()){
        Q[i] = MP[D[i]][idxs[D[i]]++];
    }
    // cout << Q << endl;
    ans += inv_num(Q);
    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 7160