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: s = input()
  t = input()
  letters = []
  count = []
  for i in range(len(s)):
      if s[i] in letters:
          count[letters.index(s[i])].append(i)
      else:
          count.append([i])
          letters.append(s[i])
  failflag = 0
  for i in count:
      r = t[i[0]]
      for j in i:
          if t[j] != r:
              failflag = 1
  letters = []
  count = []
  for i in range(len(s)):
      if t[i] in letters:
          count[letters.index(t[i])].append(i)
      else:
          count.append([i])
          letters.append(t[i])
  for i in count:
      r = s[i[0]]
      for j in i:
          if s[j] != r:
              failflag = 1
  if failflag == 0:
      print("Yes")
  else:
      print("No")
  
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"}]