#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const double PI = acos(-1.0);
const int inf = int(1e9 + 7);
const long long INF = (long long)8e18 + 7;
const int mod = int(1e9 + 7);
const int N = int(2e5 + 7);
int u[30];
int dx[] = {0, -1, 1, 0, 1, 1, -1, -1};
int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
char a[20][20];
string second;
void make(int x) {
  int add = 1, y = 0;
  for (int i = 0; i < 27; i++) u[i] = 0;
  for (int i = 0; i < 27; i++) {
    if (u[second[i] - 'A']) continue;
    u[second[i] - 'A'] = 1;
    a[x][y] = second[i];
    x += add;
    if (x == 13) x = 12, add = -1, y = 1;
    if (x == -1) x = 0, add = 1, y = 0;
  }
}
bool ch(int q, int w, char c, int tx, int ty) {
  for (int i = 0; i < 8; i++) {
    int x = q + dx[i], y = w + dy[i];
    if (x < 0 || x > 13 || y < 0 || y > 13) continue;
    if (a[x][y] != c) continue;
    for (int j = 0; j < 8; j++) {
      int tox = x + dx[j], toy = y + dy[j];
      if (tox == tx && toy == ty) return 1;
    }
  }
  return 0;
}
bool check(int x) {
  int add = 1, y = 0;
  pair<int, int> prev;
  for (int i = 0; i < 27; i++) {
    if (a[x][y] != second[i])
      if (!ch(prev.first, prev.second, second[i], x, y))
        return 0;
      else
        return 1;
    prev = make_pair(x, y);
    x += add;
    if (x == 13) x = 12, add = -1, y = 1;
    if (x == -1) x = 0, add = 1, y = 0;
  }
  return 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> second;
  for (int i = 0; i < 26; i++) {
    if (second[i] == second[i + 1]) {
      cout << "Impossible\n";
      return 0;
    }
  }
  for (int i = 0; i < 13; i++) {
    make(i);
    if (check(i)) {
      for (int j = 0; j < 2; j++) {
        for (int k = 0; k < 13; k++) cout << a[k][j];
        cout << '\n';
      }
      return 0;
    }
  }
  return 0;
}
