#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int MAXN = 2e3 + 5;
const int INF = 200000000;
const double EPS = 1e-6;
string a;
string b = "aaaaaaaaaaaaa";
string c = "aaaaaaaaaaaaa";
bool check() {
  string g[2];
  g[0] = b;
  g[1] = c;
  pair<int, int> p;
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 13; j++) {
      if (g[i][j] == a[0]) p = make_pair(i, j);
    }
  }
  for (int i = 1; i < 27; i++) {
    if (p.first == 0) {
      if (p.second == 0) {
        if (g[p.first + 1][p.second] == a[i])
          p.first++;
        else if (g[p.first + 1][p.second + 1] == a[i]) {
          p.first++;
          p.second++;
        } else if (g[p.first][p.second + 1] == a[i]) {
          p.second++;
        } else
          return 0;
      } else if (p.second == 12) {
        if (g[p.first + 1][p.second] == a[i])
          p.first++;
        else if (g[p.first + 1][p.second - 1] == a[i]) {
          p.first++;
          p.second--;
        } else if (g[p.first][p.second - 1] == a[i]) {
          p.second--;
        } else
          return 0;
      } else {
        if (g[p.first + 1][p.second] == a[i])
          p.first++;
        else if (g[p.first + 1][p.second + 1] == a[i]) {
          p.first++;
          p.second++;
        } else if (g[p.first][p.second + 1] == a[i]) {
          p.second++;
        } else if (g[p.first + 1][p.second - 1] == a[i]) {
          p.first++;
          p.second--;
        } else if (g[p.first][p.second - 1] == a[i]) {
          p.second--;
        } else
          return 0;
      }
    } else if (p.first == 1) {
      if (p.second == 0) {
        if (g[p.first - 1][p.second] == a[i])
          p.first--;
        else if (g[p.first][p.second + 1] == a[i]) {
          p.second++;
        } else if (g[p.first - 1][p.second + 1] == a[i]) {
          p.first--;
          p.second++;
        } else
          return 0;
      } else if (p.second == 12) {
        if (g[p.first - 1][p.second] == a[i]) p.first--;
        if (g[p.first - 1][p.second - 1] == a[i]) {
          p.first--;
          p.second--;
        } else if (g[p.first][p.second - 1] == a[i]) {
          p.second--;
        } else
          return 0;
      } else {
        if (g[p.first - 1][p.second] == a[i])
          p.first--;
        else if (g[p.first - 1][p.second - 1] == a[i]) {
          p.first--;
          p.second--;
        } else if (g[p.first][p.second + 1] == a[i]) {
          p.second++;
        } else if (g[p.first - 1][p.second + 1] == a[i]) {
          p.first--;
          p.second++;
        } else if (g[p.first][p.second - 1] == a[i]) {
          p.second--;
        } else
          return 0;
      }
    } else {
      return 0;
    }
  }
  return 1;
}
void solve() {
  cin >> a;
  map<char, int> m;
  for (int i = 0; i < a.size(); i++) m[a[i]]++;
  int k = 0;
  for (int i = 0; i < 13; i++) {
    if (!m[a[k]]) k++;
    if (m[a[k]] == 2) {
      b[i] = a[k];
      m[a[k]] -= 2;
    } else {
      b[i] = a[k];
    }
    k++;
  }
  for (int i = 0; i < 13; i++) {
    if (!m[a[k]]) k++;
    if (m[a[k]] == 2) {
      c[i] = a[k];
      m[a[k]] -= 2;
    } else {
      c[i] = a[k];
    }
    k++;
  }
  for (int i = 0; i < 6; i++) swap(c[i], c[12 - i]);
  for (int z = 0; z < 26; z++) {
    char h = b[b.size() - 1];
    for (int i = b.size() - 1; i >= 0; i--) {
      if (i == 0)
        b[i] = c[i];
      else
        b[i] = b[i - 1];
    }
    for (int i = 0; i < c.size() - 1; i++) {
      c[i] = c[i + 1];
    }
    c[c.size() - 1] = h;
    if (check()) {
      cout << b << endl << c << endl;
      return;
    }
  }
  cout << "Impossible";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
