Five Palindromes

Your task is to divide a string into five non-empty palindromes.

Input

Oone string consisting of n (5 ≤ n ≤ 10^5) lowercase English letters.

Output

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.

Examples