#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T POW(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * POW(B, P - 1);
  else
    return SQR(POW(B, P / 2));
}
template <typename T>
inline T ModInv(T b, T m) {
  return BigMod(b, m - 2, m);
}
template <typename T>
inline T ABS(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
template <typename T>
inline T gcd(T a, T b) {
  if (a < 0) return gcd(-a, b);
  if (b < 0) return gcd(a, -b);
  return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
inline T lcm(T a, T b) {
  if (a < 0) return lcm(-a, b);
  if (b < 0) return lcm(a, -b);
  return a * (b / gcd(a, b));
}
template <class T>
inline T BMOD(T p, T e, T m) {
  T ret = 1;
  while (e) {
    if (e & 1) ret = (ret * p) % m;
    p = (p * p) % m;
    e >>= 1;
  }
  return (T)ret;
}
int mp[230];
char grid[3][14];
int main() {
  string s;
  cin >> s;
  for (int i = 1; i <= 12; i++)
    for (int j = 1; j <= 12; j++) grid[i][j] = '.';
  int nm, st, en;
  for (int i = 0; i < s.size(); i++) {
    if (mp[s[i]]) {
      nm = (i + 1) - mp[s[i]];
      nm -= 1;
      st = mp[s[i]] - 1;
      en = i;
      break;
    }
    mp[s[i]] = i + 1;
  }
  if (nm == 0) {
    printf("Impossible");
    puts("");
    return 0;
  } else if (nm % 2 == 0) {
    int col = nm / 2;
    int i = (13 - col) + 1, tm, fc;
    fc = i - 1;
    int it = st + 1;
    for (int j = 1; j <= col; j++) {
      grid[1][i] = s[it];
      i++;
      it++;
    }
    tm = i;
    for (int j = 1; j <= col; j++) {
      grid[2][13 - (i - tm)] = s[it];
      it++;
      i++;
    }
    int row = 1, fl = 0, k = 0;
    col = fc;
    while (1) {
      if (fl == 0) {
        if (col < 1) {
          fl = 1;
          col = 1;
          continue;
        } else
          grid[1][col] = s[it];
        col--;
      } else {
        grid[2][col] = s[it];
        col++;
      }
      it = (it + 1) % 27;
      if (col > fc) break;
    }
  } else {
    int col = (nm) / 2;
    int i = (13 - col) + 1, tm, fc;
    fc = i - 1;
    int it = st + 1;
    for (int j = 1; j <= col; j++) {
      grid[1][i] = s[it];
      i++;
      it++;
    }
    tm = i;
    col += 1;
    i = 13;
    for (int j = 1; j <= col; j++) {
      grid[2][i] = s[it];
      it++;
      i--;
    }
    int row = 1, fl = 0, k = 0;
    col = i + 1;
    fc = col;
    while (1) {
      if (fl == 0) {
        if (col < 1) {
          fl = 1;
          col = 1;
          continue;
        } else
          grid[1][col] = s[it];
        col--;
      } else {
        if (grid[2][col] != '.') break;
        grid[2][col] = s[it];
        col++;
      }
      it = (it + 1) % 27;
      if (col >= fc) break;
    }
  }
  for (int i = 1; i <= 13; i++) {
    cout << grid[1][i];
  }
  puts("");
  for (int i = 1; i <= 13; i++) {
    cout << grid[2][i];
  }
  puts("");
  return 0;
}
