eolymp

Easy

Given a string s, determine if it can be a palindrome after deleting exactly one character.

Input

Contains a string s (1 ≤ length(s) ≤ 106).

Output

Print yes, if after deleting exactly one character from string s, it turns to palindrome, otherwise print no.

If answer is yes, in the second line of output print the resulting palindrome string. If there are several solutions print any of them.

Time limit 1 second
Memory limit 128 MiB
Input example #1
abccxba
Output example #1
yes
abccba
Input example #2
dsfsfasf
Output example #2
no
Source 2014 KBTU Open, Spring Kazakhstan, Almaty, April, 20, Problem C