시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 2048 MB53494491.667%

문제

Your highly intelligent girlfriend, Jeannetta Ewell from Mississippi, loves to concatenate letters. For each of your anniversaries, you prepare a jar of letter jelly as a gift for Jeannetta. One of her favorite linguistic constrictions is that of a palindrome. In a palindrome, each letter reappears in place after a reorientation, reversing the string. For example, the word "racecar" is a palindrome, as it reads the same forwards and backwards.

After writing out "jeannetta" with her letter jelly, by arranging the letters in the order "natejetan", she suddenly realized that she made a palindrome! This incidence lead to Jeannetta introducing her inventive definition of a dralinpome. In a dralinpome, the letters can be rearranged to form a palindrome.

Jeannetta now seeks to know all dralinpomes in the dictionary. However, due to her disinterestedness in programming, she would need to manually consider each word in the dictionary. While she has no idea what to do with an array or a queue, you and your teammates reparticipate in programming competitions each year. Therefore, you decide to help her and prepare a program that testifies of any given word whether it is a dralinpome or not.

입력

The input consists of:

  • One line with a string $s$ ($1\leq |s|\leq 10^5$), the word to check. The word consists of only English lowercase letters (a-z).

출력

Output "yes" if the given word is a dralinpome, or "no" otherwise.

예제 입력 1

zoo

예제 출력 1

yes

예제 입력 2

yes

예제 출력 2

no

예제 입력 3

cacao

예제 출력 3

yes

예제 입력 4

multinomiaalcoefficient

예제 출력 4

yes

예제 입력 5

racecars

예제 출력 5

no