Your task is to divide a string into five non-empty palindromes.
The input contains one string consisting of n lowercase English letters
(5 ≤ n ≤ 105).
Output “NO” if such division is impossible.
Otherwise, output “YES” on the first line, and
the next five lines should contain one palindrome each,
which, if concatenated in this order, form the given string.
Problem Author: Mikhail Rubinchik (prepared by Kirill Borozdin)
Problem Source: Ural FU contest. Kontur Cup. Petrozavodsk training camp. Winter 2013