Source

This problem is adapted from Long Long OJ. All rights reserved.

Problem Description

Given a string $S$, determine whether it is a Jini string (Chicken You string).

Definition of Jini string: Punctuation marks are ignored automatically; you only need to check if the letters read forward are the same as those read backward.

Input Format

A single line containing a string $S$.

Output Format

A single line containing the string $\tt{Yes}$ or $\tt{No}$.

Samples

jntm,ohh,bb,hh,o,mt,nj

Yes

cxkwsxhz,zhxswkk

No

Data Range

$1 \le |S| \le 1.1 \times 10^7$, and $S$ only contains lowercase letters or commas.