#K63797. Can Form Palindrome

    ID: 31833 Type: Default 1000ms 256MiB

Can Form Palindrome

Can Form Palindrome

Given a string s consisting of lowercase English letters, determine whether it is possible to rearrange the characters (after deleting at most one character) to form a palindrome.

A palindrome is a word that reads the same backward as forward.

You are allowed to remove at most one character from s to help achieve this. Output YES if it is possible to form a palindrome under these conditions, or NO otherwise.

inputFormat

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

abca

outputFormat

Output a single line containing either YES or NO based on whether it is possible to rearrange the string (after at most one deletion) into a palindrome.

## sample
abca
YES

</p>