Author:  M. Sporyshev, A. Klenin, A. Baranov  Time limit:  1 sec  
Input file:  input.txt  Memory limit:  256 Mb  
Output file:  output.txt 
For arbitrary nonempty strings S_{1} and S_{2}, the Fibonacci sequence of strings is defined by a recurrence S_{i + 2} = S_{i + 1} + S_{i}, where the '+' sign denotes string concatenation.
Let's say that string T has Fibonacci level n if there exists some Fibonacci sequence of strings which contains S_{n} = T. Note that any string of length 2 or more has Fibonacci level 3.
Your program must, given a string T, find its maximum Fibonacci level n as well as two starting strings S_{1} and S_{2} of corresponding Fibonacci sequence of strings.
Input file contains a single string T, consisting of lowercase Latin letters.
Output file must contain 3 lines: integer n followed by strings S_{1} and S_{2}.
If there are several optimal solutions, output any of them.
2 ≤ T ≤ 10^{6}
No.  Input file (input.txt ) 
Output file (output.txt ) 

1 


2 


3 

