output_description: Print `Yes` if w is beautiful. Print `No` otherwise.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      w
attempt: #include <iostream>
  #include <string>
  #include <map>
  #include <cfenv>
  #include <cmath>
  #include <vector>
  #include<cstdio>
  #include <iterator>
  #include <sstream>
  #include <algorithm>
  #include <numeric>
  using namespace std;
  typedef long long ll;
  int main() {
  	string s;
  	cin >> s;
  	vector<int> c(26,0);
  	for (int a = 0; a < s.size(); a++) {
  		c[s[a] - 97]++;
  	}
  	bool f = true;
  	for (int a = 0; a < c.size(); a++) {
  		if (c[a] % 2 == 1)f = false;
  	}
  	cout <<(f?"Yes":"No")<< endl;
  }
  	
problem_description: 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.
samples: [{"input": "abaccaba", "output": "Yes\n    \n\n`a` occurs four times, `b` occurs twice, `c` occurs twice and the other\nletters occur zero times.\n\n* * *"}, {"input": "hthth", "output": "No"}]