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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main(){
    string w;
    cin >> w;

    // 配列の宣言　型　配列名[要素の個数] = {要素の一覧}
    int data[26] = {0};
    for(int i = 0; i < w.size(); i++){
        //今見ている文字をアルファベットの昇順に変換する
        int index = w.at(i) - 'a';
        // カウンタを増やす
        data[index] ++;
    }
    int flag = 0;
    //数え上げたアルファベットの数を確認する
    for(int i = 0; i < 26; i++){
        if(data[i] %2 == 1) flag =1;
    }
    if(flag ==0)cout << "Yes" <<endl;
    else cout << "No" << endl;
    
}