100441: [AtCoder]ABC044 B - Beautiful Strings

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:2 Solved:0

Description

Score : $200$ points

Problem Statement

Let $w$ be a string consisting of lowercase letters. We will call $w$ beautiful if the following condition is satisfied:

  • Each lowercase letter of the English alphabet occurs even number of times in $w$.

You are given the string $w$. Determine if $w$ is beautiful.

Constraints

  • $1 \leq |w| \leq 100$
  • $w$ consists of lowercase letters (a-z).

Input

The input is given from Standard Input in the following format:

$w$

Output

Print Yes if $w$ is beautiful. Print No otherwise.


Sample Input 1

abaccaba

Sample Output 1

Yes

a occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.


Sample Input 2

hthth

Sample Output 2

No

Input

题意翻译

输入一个字符串,判断每个字母出现的次数是否都为偶数 如果是,输出“Yes”,否则输出“No”

加入题单

上一题 下一题 算法标签: