#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    string s;
    cin >> s;
    int a[26] = {};
    for (char c : s) a[c - 'a']++;

    string ans;

    REP(i,26){
        if (a[i] > 2){
            cout << "Impossible" << endl;
            return 0;
        }
        if (a[i] == 1){
            ans += i + 'a';
        }
    }

    cout << (ans.length() == 1 ? ans : "Impossible") << endl;

    return 0;
}