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 JAVA):

Solution:
import java.util.*;
import java.io.*;
public class HiddenWord
{


	/************************ SOLUTION STARTS HERE ***********************/



	private static void solve(FastScanner s1, PrintWriter out){

		String str = s1.nextLine();
		int pos[] = new int[26];
		Arrays.fill(pos, -1);
		int start = -1 , end = -1;
		for(int i = 0 , len = str.length();i < len;i++) {
			char ch =  str.charAt(i);
			if(pos[ch - 'A'] != -1) {
				start = pos[ch - 'A'];
				end = i;
				break;
			}
			else
				pos[ch - 'A'] = i;
		}

		if(end - start == 1)
			out.println("Impossible");
		else {
			char grid[][] = new char[2][13];
			String sandWich = str.substring(start + 1, end);
			int size = sandWich.length();
			int r = 0 , c = 13 - (size / 2);
			int dir = 1;
			grid[0][c - 1] = str.charAt(start);
			if(size == 1) {
				grid[1][c - 1] = sandWich.charAt(0);
				dir = -1;
				r = 1;
				c = 11;
			}
			else {
				for(int i=0;i<size;i++) {   // Fill sand wich
					grid[r][c] = sandWich.charAt(i);
					//out.println("r " + r + " c " + c + " char " + grid[r][c]);
					if(c == 12 && dir == 1) {
						dir = -1;
						r = 1;
					}
					else
						c += dir;
				}
			}
			String before = str.substring(0, start);
			for(int i=before.length()-1;i >= 0;i--) {
				grid[r][c] = before.charAt(i);
				//out.println("r " + r + " c " + c + " char " + grid[r][c]);
				if(c == 0 && dir == -1) {
					dir = 1;
					r = 0;
				}
				else
					c += dir;
			}
			String after = str.substring(end + 1);
			for(int i = after.length() - 1;i >= 0;i--) {
				grid[r][c] =  after.charAt(i);
				//out.println("r " + r + " c " + c + " char " + grid[r][c]);
				if(c == 0 && dir == -1) {
					dir = 1;
					r = 0;
				}
				else
					c += dir;
			}
			
			
			out.println(new String(grid[0]));
			out.println(new String(grid[1]));
		}

	}
// ADEFGHIJKLMNOPBQRSCTUVWXYZA


	/************************ SOLUTION ENDS HERE ************************/





	/************************ TEMPLATE STARTS HERE *********************/

	public static void main(String []args) throws IOException {
		FastScanner in  = new FastScanner(System.in);
		PrintWriter out = 
				new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)), false); 
		solve(in, out);
		in.close();
		out.close();
	}    

	static class FastScanner{
		BufferedReader reader;
		StringTokenizer st;
		FastScanner(InputStream stream){reader=new BufferedReader(new InputStreamReader(stream));st=null;}	
		String next()
		{while(st == null || !st.hasMoreTokens()){try{String line = reader.readLine();if(line == null){return null;}		    
		st = new StringTokenizer(line);}catch (Exception e){throw new RuntimeException();}}return st.nextToken();}
		String nextLine()  {String s=null;try{s=reader.readLine();}catch(IOException e){e.printStackTrace();}return s;}	    	  	
		int    nextInt()   {return Integer.parseInt(next());}
		long   nextLong()  {return Long.parseLong(next());}		
		double nextDouble(){return Double.parseDouble(next());}
		char   nextChar()  {return next().charAt(0);}
		int[]  nextIntArray(int n)         {int[] arr= new int[n];   int i=0;while(i<n){arr[i++]=nextInt();}  return arr;}
		long[] nextLongArray(int n)        {long[]arr= new long[n];  int i=0;while(i<n){arr[i++]=nextLong();} return arr;}	
		int[]  nextIntArrayOneBased(int n) {int[] arr= new int[n+1]; int i=1;while(i<=n){arr[i++]=nextInt();} return arr;}	    	
		long[] nextLongArrayOneBased(int n){long[]arr= new long[n+1];int i=1;while(i<=n){arr[i++]=nextLong();}return arr;}	    	
		void   close(){try{reader.close();}catch(IOException e){e.printStackTrace();}}				
	}

	/************************ TEMPLATE ENDS HERE ************************/
}