Problem: Let’s define a grid to be a set of tiles with 2 rows and 13 columns. Each tile has an English letter written in it. The letters don't have to be unique: there might be two or more tiles with the same letter written on them. Here is an example of a grid:
    
    
    ABCDEFGHIJKLM  
    NOPQRSTUVWXYZ

We say that two tiles are adjacent if they share a side or a corner. In the example grid above, the tile with the letter 'A' is adjacent only to the tiles with letters 'B', 'N', and 'O'. A tile is not adjacent to itself.

A sequence of tiles is called a path if each tile in the sequence is adjacent to the tile which follows it (except for the last tile in the sequence, which of course has no successor). In this example, "ABC" is a path, and so is "KXWIHIJK". "MAB" is not a path because 'M' is not adjacent to 'A'. A single tile can be used more than once by a path (though the tile cannot occupy two consecutive places in the path because no tile is adjacent to itself).

You’re given a string s which consists of 27 upper-case English letters. Each English letter occurs at least once in s. Find a grid that contains a path whose tiles, viewed in the order that the path visits them, form the string s. If there’s no solution, print "Impossible" (without the quotes).

Input

The only line of the input contains the string s, consisting of 27 upper-case English letters. Each English letter occurs at least once in s.

Output

Output two lines, each consisting of 13 upper-case English characters, representing the rows of the grid. If there are multiple solutions, print any of them. If there is no solution print "Impossible".

Examples

Input

ABCDEFGHIJKLMNOPQRSGTUVWXYZ


Output

YXWVUTGHIJKLM
ZABCDEFSRQPON


Input

BUVTYZFQSNRIWOXXGJLKACPEMDH


Output

Impossible

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
inline void gmax(T1 &a, T2 b) {
  if (b > a) a = b;
}
template <class T1, class T2>
inline void gmin(T1 &a, T2 b) {
  if (b < a) a = b;
}
const int N = 100;
const int ms63 = 0x3f3f3f3f;
int casenum, casei;
void fre() { freopen("/home/hyf/Desktop/programs/in.txt", "r", stdin); }
map<char, int> mop;
char s[N], s1[N], s2[N];
int len, flag, st, ed, num, lft, t;
int main() {
  while (~scanf("%s", s)) {
    mop.clear();
    len = strlen(s);
    flag = 0;
    for (int i = 0; i < len; i++) {
      if (mop.find(s[i]) == mop.end()) {
        mop[s[i]] = i;
      } else {
        if (mop[s[i]] != i - 1) {
          flag = 1;
          st = mop[s[i]];
          ed = i;
          break;
        }
      }
    }
    if (!flag)
      puts("Impossible");
    else {
      num = ed - st;
      if (num % 2 == 0) {
        lft = num / 2;
        s2[lft] = s[st];
        t = st;
        for (int i = lft; i >= 1; i--) {
          t++;
          if (t == ed) t++;
          if (t >= 27) t -= 27;
          s1[i] = s[t];
        }
        for (int i = 1; i < lft; i++) {
          t++;
          if (t == ed) t++;
          if (t >= 27) t -= 27;
          s2[i] = s[t];
        }
        for (int i = lft + 1; i <= 13; i++) {
          t++;
          if (t == ed) t++;
          if (t >= 27) t -= 27;
          s1[i] = s[t];
        }
        for (int i = 13; i >= lft + 1; i--) {
          t++;
          if (t == ed) t++;
          if (t >= 27) t -= 27;
          s2[i] = s[t];
        }
      } else {
        lft = num / 2;
        s2[lft + 1] = s[st];
        t = st;
        for (int i = lft; i >= 1; i--) {
          t++;
          if (t == ed) t++;
          if (t >= 27) t -= 27;
          s1[i] = s[t];
        }
        for (int i = 1; i <= lft; i++) {
          t++;
          if (t == ed) t++;
          if (t >= 27) t -= 27;
          s2[i] = s[t];
        }
        for (int i = lft + 1; i <= 13; i++) {
          t++;
          if (t == ed) t++;
          if (t >= 27) t -= 27;
          s1[i] = s[t];
        }
        for (int i = 13; i >= lft + 2; i--) {
          t++;
          if (t == ed) t++;
          if (t >= 27) t -= 27;
          s2[i] = s[t];
        }
      }
      printf("%s\n%s\n", s1 + 1, s2 + 1);
    }
  }
  return 0;
}