2013 Petrozavodsk, February 2
Your task is to divide a string into five non-empty palindromes.
Oone string consisting of n (5 ≤ n ≤ 105) lowercase English letters.
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.
YES a aa bb cdc aa