Five Palindromes#5612
Your task is to divide a string into five non-empty palindromes.
One string consisting of (5 \leq n \leq 10^5) lowercase English letters.
Output NO if such a division is impossible. Otherwise, output YES on the first line, and the next five lines should contain one palindrome each, which, when concatenated in this order, form the given string.
Example 1