One Removal Palindrome Check

Given a string S consisting of lowercase letters, determine whether it is possible to remove at most one character from S such that the resulting string is a palindrome.

A string is a palindrome if it reads the same backward and forward. In other words, a string S = s₁s₂...s_n is a palindrome if for every index i (with 1 ≤ i ≤ n), the condition $$s_i = s_{n-i+1}$$

holds.

Your task is to output "Yes" if it is possible to obtain a palindrome by performing at most one removal of a character from S, and "No" otherwise.

inputFormat

The input consists of a single line containing the string S.

outputFormat

Output a single line containing either "Yes" or "No" depending on whether it is possible to obtain a palindrome after removing at most one character from S.

## sample

abca

Yes

</p>