#include <bits/stdc++.h>
using namespace std;
char s[30];
char result[2][30];
int cnt[30];
int index1, index2;
void solve() {
  if (index1 == index2 - 1) {
    cout << "Impossible" << endl;
    return;
  }
  int len = index2 - index1;
  int up = (len + 1) / 2;
  int down = len - up;
  int row = 0, col = up - 1;
  for (int i = index1; i < index2; i++) {
    result[row][col] = s[i];
    if (row == 0) {
      --col;
      if (col == -1) {
        col = 0;
        row = 1;
      }
    } else {
      ++col;
    }
  }
  row = 0, col = up;
  if (col >= 13) {
    row = 1;
    col = 12;
  }
  for (int i = index1 - 1; i >= 0; i--) {
    result[row][col] = s[i];
    if (row == 0) {
      ++col;
      if (col == 13) {
        col = 12;
        row = 1;
      }
    } else {
      --col;
    }
  }
  row = 1, col = down;
  for (int i = index2 + 1; i < 27; i++) {
    result[row][col] = s[i];
    if (row == 1) {
      ++col;
      if (col == 13) {
        col = 12;
        row = 0;
      }
    } else {
      --col;
    }
  }
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 13; j++) {
      printf("%c", result[i][j]);
    }
    printf("\n");
  }
}
int main() {
  while (scanf("%s", s) != EOF) {
    int n = strlen(s);
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < n; i++) {
      ++cnt[s[i] - 'A'];
      if (cnt[s[i] - 'A'] == 2) {
        index2 = i;
        break;
      }
    }
    for (int i = 0; i < n; i++) {
      if (s[i] == s[index2]) {
        index1 = i;
        break;
      }
    }
    solve();
  }
  return 0;
}
