#include <bits/stdc++.h>
using namespace std;
char a[31], a1[31], a2[31];
int n, i, j, m, b[300];
int main() {
  scanf("%s", a);
  int bj = 0, t1 = -1, t2 = -1;
  for (i = 0; i < 27; i++) {
    for (j = i + 2; j < 27; j++)
      if (a[j] == a[i]) {
        bj = 1;
        t1 = i;
        t2 = j;
        break;
      }
    if (bj) break;
  }
  if (bj == 0) {
    printf("Impossible");
    return 0;
  }
  int gs = j - i;
  m = t1;
  for (i = (gs + 1) / 2; i >= 1; i--) a1[i] = a[t1++];
  for (i = 1; i <= gs / 2; i++) a2[i] = a[t1++];
  for (i = (gs + 1) / 2 + 1; i <= 13; i++) a1[i] = a[--m];
  for (i = 13; i >= 1, m > 0; i--) a2[i] = a[--m];
  for (i = 1; i <= 13; i++)
    if (a2[i] < 'A' || a2[i] > 'Z') a2[i] = a[++t2];
  for (i = 13; i >= 1; i--)
    if (a1[i] < 'A' || a1[i] > 'Z') a1[i] = a[++t2];
  printf("%s\n", a1 + 1);
  printf("%s\n", a2 + 1);
}
