#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<iomanip>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
#define EVEL 1
#ifndef EVEL
#define DEB(X) cout << #X << ":" <<X<<" " ;
#define TF(f) f ? cout<<"true  " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {X=X;}
#define TF(f) {f=f;}
#define END {}
#endif
    string S;
     int Y=0,E=0,A[30],H=0,EX=0;
    bool fir=true;
int main(){
    ios::sync_with_stdio(false);
    cin>>S;
    sort(S.begin(),S.end());
    string as="Impossible\0";
    REP(i,13){
        A[((int)S[i]-'a')%26]++;

    }
    REP(i,26){
        if(A[i]==0)continue;
DEB(as)DEB(A[i])TF(fir)END
        if(A[i]>2){as="Impossible";break;}
        if(A[i]==1){
            if(!fir){as="Impossible";break;}
            as=(char)(i+(int)'a');fir=false;
        }
    }
    cout<<as<<endl;
return 0;
}