Problem:
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

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<cstdio>
#include<functional>
#include<algorithm>
#include<cstring>
using namespace std;
int main(void)
{
	char w[101];
	int i,al[26],len,flg,x;
	scanf("%s",w);
	len=strlen(w);
	for(i=0;i<26;i++)	al[i]=0;
	for(i=0;i<len;i++)	{
		x=w[i]-'a';
		al[x]++;
	}
	flg=1;
	for(i=0;i<26;i++)	{
		if(al[i]%2!=0)	{
			flg=0;	break;
		}
	}
	if(flg==1)	printf("Yes\n");
	else printf("No\n");
	return 0;
}