#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <limits.h>
#include <assert.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <bitset>
#include <vector>
using namespace std;

#define LL long long

#define fi first
#define se second
#define lson l,mid,id<<1
#define rson mid+1,r,id<<1|1
#define ls id<<1
#define rs id<<1|1
#define MID(a,b) (((a)+(b))>>1)
#define maxx(a,b) ((a)<(b)?(b):(a))
#define minx(a,b) ((a)<(b)?(a):(b))
#define absx(a) ((a)<0?-(a):(a))
#define mk(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define itr iterator
#define lowbit(x) ((x)&-(x))

typedef unsigned LL ULL;
typedef unsigned uint;
typedef map<int,int> mii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<LL,LL> pLL;

template< typename T > inline void read(T &x) {
    static bool fr_f; static char fr_ch;
    fr_f=0; x=0; fr_ch=getchar();
    while(fr_ch<'0' || '9'<fr_ch) {if(fr_ch=='-') fr_f=1; fr_ch=getchar();}
    while('0'<=fr_ch && fr_ch<='9') {x=(x<<1)+(x<<3)+fr_ch-'0'; fr_ch=getchar();}
    if(fr_f) x=-x;
}

template< typename T > inline void Max (T &a, T b) {if(a<b) a=b;}
template< typename T > inline void Min (T &a, T b) {if(b<a) a=b;}
template< typename T > inline void Swap(T &a, T &b) {T c=a;a=b;b=c;}
template< typename T > inline T Abs(T a) {if(a<0) return -a; else return a;}

const double   pi = acos(-1.0) ;
const int     MOD = (int)1e9+7 ;
const int     INF = (int)0x3f3f3f3f ;
const LL     LINF = (LL)INF<<32|INF ;
const int    SINF = (uint)(-1)>>1 ;
const LL    SLINF = (ULL)(-1)>>1 ;
const double DINF = 1e50 ;
const double  eps = 1e-5 ;
const int    maxn = (int) 2e5+20 ;
const int    maxm = (int) 25000+20 ;
const int    maxk = (int) 1000+20 ;

inline int sig(double x) {return x<-eps?-1:x>eps;}
inline LL fp(LL a,LL n,LL p) {LL res=1; for(;n;n>>=1,a=a*a%p) if(n&1) res=res*a%p; return res;}
template<typename T>inline T gcd(T a,T b) {for(T c;b;c=a%b,a=b,b=c); return a;}

//--------------------start--------------------

int n;
char s[maxn],s2[maxn];
vector<int> vec[26];
int f[maxn];
int cnt[26];

int T[maxn];

inline int sum(int pos)
{
    int res=0;
    for(int i=pos;i;i-=lowbit(i)) res+=T[i];
    return res;
}
inline void add(int pos,int val)
{
    for(int i=pos;i<=n;i+=lowbit(i)) T[i]+=val;
}

pii p[maxn];


void work()
{
    scanf("%s",s);
    n=strlen(s);

    for(int i=0,c;i<n;i++)
    {
        c=s[i]-'a';
        vec[c].pb(i);
    }

    int fg=0;

    for(int i=0;i<26;i++) fg+=vec[i].size()&1;

    if(fg>1)
    {
        puts("-1");
        return ;
    }

    for(int i=0;i<26;i++)
    {
        cnt[i]=vec[i].size()/2;
        if(vec[i].size()&1) s2[n/2]=i+'a';
    }

    int m=n/2;

    for(int i=0,j=0,c;i<m;i++)
    {
        while(1)
        {
            c=s[j]-'a';
            if(cnt[c]==0) j++;
            else
            {
                cnt[c]--;
                j++;
                break;
            }
        }
        s2[i]=s2[n-i-1]='a'+c;
    }
    s2[n]=0;


    for(int i=0,c;i<n;i++)
    {
        c=s2[i]-'a';
        p[i]=mk(vec[c][cnt[c]++]+1,i+1);
    }

    sort(p,p+n);
    reverse(p,p+n);

    LL ans=0;

    for(int i=0;i<n;i++)
    {
        ans+=sum(p[i].se);
        add(p[i].se,1);
    }

    cout <<ans <<endl;
}

//---------------------end---------------------

int main()
{
#ifdef yukihana0416
freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
#endif // yukihana0416
    work();
    return 0;
}


Measured memory_bytes: 4088