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 (Python):
s = input()

l = []
roll = ord('z')-ord('a')+1

for i in range(roll):
    l.append(0)

for i in range(len(s)):
    num = ord(s[i])
    l[num-97] += 1
    

for i in range(roll):
    if l[i]%2 != 0:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w = input()
alph = ["a","b","c","d","e","f","g","h",
        "i","j","k","l","m","n","o","p","q",
        "r","s","t","u","v","w","x","y","z"]
ck = 0
for i in range(0, 26):
    if w.count(alph[i])%2 == 1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
import sys

w = list(input())
elements = set(w)

for char in elements:
  if w.count(char) % 2 == 1:
    print("No")
    sys.exit()

print("Yes")

Solution (Python):
w=input()
a=1
for i in range(len(w)):
    if w.count(w[i])%2==0:
        a=a*1
    else:
        a=a*0
if a==0:
    print("No")
else:
    print("Yes")

Solution (Python):
from collections import Counter
c = Counter(raw_input())
b = True
for k,v in c.items():
  if v%2 == 1:
    b = False
if b:
  print 'Yes'
else:
  print 'No'

Solution (Python):
w = input()
S = set(w)
for s in S:
    if w.count(s)%2 == 1:
        print("No")
        exit()
print("Yes")

Solution (Python):
from collections import Counter
w = Counter(input())
ans = True
for items in w.values():
    if items % 2 != 0:
        ans = False
        break
        
print("Yes") if ans else print("No")

Solution (Python):
w=input()
t=[]
for i in range(len(w)):
  if w[i] in t:
    t.remove(w[i])
  else:
    t.append(w[i])
if len(t) == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys
w = input()
for i in w:
    if w.count(i) % 2 == 1:
        print('No')
        sys.exit()
print('Yes')

Solution (Python):
s = input()
array = []
for i in range(len(s)):
  array.append(s[i])

yes = 1
for i in range(len(array)):
  counter = array.count(array[i])
  if counter % 2 == 1:
    yes = 0
    break

if yes == 1:
  print("Yes")
else:
  print("No")

Solution (Python):
w = input()
lis = {}

for i in w:
    if i in lis:
        lis[i] = not(lis[i])
    else:
        lis[i] = False

flag = True
for b in lis.values():
    if not(b):
        print("No")
        flag = False
        break

if(flag):
    print("Yes")

Solution (Python):
S = input()
print("Yes" if all([S.count(e) % 2 == 0 for e in set(S)]) else "No")

Solution (Python):
S = input()
S_elements = set(S)
for e in S_elements:
  if S.count(e) % 2 != 0:
    print("No")
    exit()
print("Yes")

Solution (Python):
w = input()

length = len(w)

letters = []
for i in range(length):
    if w[i] not in letters:
        letters.append(w[i])

wareru = True
for i in range(len(letters)):
    if(w.count(letters[i])%2 != 0):
        wareru = False

if wareru:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
set_s = set(s)

tmp = True
for i in set_s:
    if s.count(i) %2 != 0:
        tmp = False
print("Yes" if tmp else "No")

Solution (Python):
s=input()
for i in set(s):
    if s.count(i)%2!=0:
        print('No')
        exit()
print('Yes')

Solution (Python):
s=input()
for j in range(97,123):
    if s.count(chr(j))%2!=0:
        print('No')
        exit()
print('Yes')

Solution (Python):
import collections
if __name__ == "__main__":
    w = input()
    d = collections.defaultdict(int)
    for c in w:
        d[c] += 1
    is_beautiful = True
    for v in d.values():
        if v % 2 != 0:
            is_beautiful = False
            break
    print("Yes" if is_beautiful else "No")

Solution (Python):
dic = dict()
s = input()
for c in s:
    if c not in dic.keys():
        dic[c]=0
    dic[c]+=1
print(["No","Yes"][all(map(lambda x: x%2==0, dic.values()))])

Solution (Python):
from collections import Counter
S = input()
ctr = Counter(S)
for v in ctr.values():
    if v%2 == 0:
        continue
    else:
        print('No')
        exit()
print('Yes')

Solution (Python):
from collections import Counter
c=Counter(list(input()))
for i,j in c.most_common():
  if j%2 ==1:
    print("No")
    exit()
else:
  print("Yes")

Solution (Python):
from collections import defaultdict
dic = defaultdict(int)
w = input()
for i in range(len(w)):
    dic[w[i]] += 1

flag = True
for v in dic.values():
    if v % 2 != 0:
        flag = False
        break

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    w = input()
    
    w_dic = dict()
    for i in w:
        w_dic[i] = w_dic.get(i, 0) + 1
    
    for i in w_dic:
        if w_dic[i] % 2 == 1:
            print("No")
            break
            
    else:
        print("Yes")
        
        
if __name__ == "__main__":
    main()

Solution (Python):
w=input()
for c in set(w):
    if w.count(c)%2!=0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):

from collections import Counter
def inpl(): return list(map(int, input().split()))

C = Counter(input())
if all([v%2==0 for v in C.values()]):
    print("Yes")
else:
    print("No")

Solution (Python):
w = list(input())

for i in w:
    if w.count(i) % 2 == 0:
        continue
    else:
        print("No")
        exit()
print("Yes")

Solution (Python):

d = {}
for ch in list(input()):
    if ch not in d:
        d[ch] = 1
    else:
        d[ch] += 1

for k,v in d.items():
    if v % 2 == 0:
        pass
    else:
        print('No')
        exit()

print('Yes')

Solution (Python):
A = input()
W = []
for i in A:
	W.append(i)
W.sort()
if W[0::2] == W[1::2]:
	print('Yes')
else:
	print('No')

Solution (Python):
w = input()
for i in w:
    if w.count(i)%2!=0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
word = input()
char_set = set(list(word))
flag = 0
for w in char_set:
    if list(word).count(w) % 2 == 1:
        flag = 1

if flag: print('No')
else: print('Yes')

Solution (Python):
W = input()
W_change = set(W)

course = True
for i in W_change:
	n = W.count(i)
	if n % 2 != 0:
		course = False
		break

if course:
	print("Yes")
else:
	print("No")

Solution (Python):
in1 = list(input())
in1.sort()
i = 1
flg = True
if len(in1) %2 != 0:
  flg=False
else:
  while i < len(in1):
    if in1[i] != in1[i-1]:
      flg = False
      break
    i+=2
if flg:
  print("Yes")
else:
  print("No")

Solution (Python):
from collections import defaultdict

w = input()
wl = defaultdict(int)

for i in w:
    wl[i] += 1
    
if len(list(filter(lambda x:x%2!=0,wl.values())))==0:
    print("Yes")
else:
    print("No")

Solution (Python):
w = raw_input()
wl = []
for i in range(0, len(w)):
	wl.append(w[i])
wl.sort()

if len(wl) % 2 != 0: print("No")
else:
	flag = True
	for i in range(0, len(wl)/2):
		if wl[2*i] != wl[2*i+1]:
			flag = False
			break
	if flag: print("Yes")
	else: print("No")

Solution (Python):
w = input()

w_set = set(w)
fine = True
for c in w_set:
    n=w.count(c)
    if n%2 != 0:
        fine = False
        break

if fine:
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import defaultdict
w = input()
d = defaultdict(int)
flag = True
for s in w:
    d[s] += 1
for k in d:
    if not d[k]%2==0:
        flag = False
print('Yes' if flag else 'No')

Solution (Python):
a = input()
b = 0
for i in range(len(a)):
    if a.count(a[i]) % 2 ==0:
        b += 1
    else:
        b -= 1000
if b >= 1:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

w_list = list(input())
w_element = list(set(w_list))

for w in w_element:
    if w_list.count(w) % 2 != 0:
        print("No")
        sys.exit()
        
print("Yes")

Solution (Python):
from collections import Counter
C = Counter(input())
R = "Yes"
for k,v in C.most_common():
    if v%2 == 1:
        R = "No"
        break
print(R)

Solution (Python):





if __name__ == '__main__':
    from collections import Counter

    w = Counter(input())
    result = 'Yes'

    for count in w.values():
        if count % 2 != 0:
            print('No')
            exit()

    print(result)

Solution (Python):
w = input()
for i in w:
    if w.count(i)%2!=0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
c = {}
for i in input():
    if i not in c:
        c[i] = 1
    else:
        c[i] += 1
for i in c.values():
    if i %2 != 0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
from collections import Counter

def main(s):
    cnt = Counter(s)
    for w, c in cnt.most_common():
        if c%2!=0:
            return "No"
    return "Yes"


if __name__ == '__main__':
    print(main(input()))

Solution (Python):
import math
import sys
from collections import Counter

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result

arr_data = getinputdata()

w = arr_data[0][0]

cnt=Counter(w)

flg=True

for k in cnt:
    

    
    if cnt[k] % 2==1:
        
        flg=False
        break
        
        
print("Yes" if flg else "No")

Solution (Python):
import sys
import io


def run(input: io.TextIOBase, output: io.TextIOBase):
    d = set()
    for i in input.readline().strip():
        if i in d:
            d.remove(i)
        else:
            d.add(i)
    if len(d) == 0:
        r = "Yes"
    else:
        r = "No"
    output.write(r + '\n')


if __name__ == '__main__':
    run(sys.stdin, sys.stdout)

Solution (Python):
w = list(input())
w_set = set(w)
for s in w_set:
    count_2 = w.count(s)
    if count_2 % 2 == 0:
        result = "Yes"
    else:
        result = "No"
        break
print(result)

Solution (Python):
alp = "abcdefghijklmnopqrstyvwxyz"
alp = (list(alp))
w = list(input())
flag = 0
for i in range(26):
    if w.count(alp[i]) % 2 == 0:
        continue
    else:
        flag = 1
        break
if flag == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
def test(W):
    c=[0 for i in range(26)]
    for i in W:
        c[ord(i)-97]+=1
    for i in range(26):
        if c[i]%2==1:
            return False
    return True
w=input()
if test(w):
    print("Yes")
else:
    print("No")

Solution (Python):
import collections
s = input()
c = collections.Counter(s)
if all(i[1]%2==0 for i in c.most_common()): print("Yes")
else: print("No")

Solution (Python):
from collections import Counter
w = [i for i in input()]
listW = Counter(w)
ans = "Yes"
for x in listW.values():
    if x % 2 == 0:
        continue
    else:
        ans = "No"
print(ans)

Solution (Python):
w=input()
dict={}
for i in range(len(w)):
  if w[i] in dict:
    dict[w[i]]+=1
  else:
    dict[w[i]]=1
ans=True
for a,b in dict.items():
  if b%2==1:
    print("No")
    ans=False
    break
if ans:
  print("Yes")

Solution (Python):
from collections import Counter

word = input()
c = Counter(word)
counts = c.values()
print('Yes') if all(map(lambda x: x % 2 == 0, counts)) else print('No')

Solution (Python):
w=input()
for alphabet in w:
    if w.count(alphabet)%2!=0:
        print("No")
        exit()
print("Yes")

Solution (Python):
s = input()
dict = {}
for i in range(len(s)):
  if s[i] in dict:
    dict[s[i]] += 1
  else:
    dict[s[i]] = 1
flg = True
for v in dict.values():
  if v%2 > 0:
    flg = False
    break
if flg:
  print('Yes')
else:
  print('No')

Solution (Python):
from collections import defaultdict

W = input()

D = defaultdict(int)

for w in W:
    D[w] += 1

ret = True
for v in D.values():
    if v % 2 == 1:
        ret = False
        break

print('Yes' if ret else 'No')

Solution (Python):
from collections import Counter

def solve():
    c = Counter(input())
    for cnt in c.values():
        if cnt %2 != 0:
            print("No")
            return
    print("Yes")

solve()

Solution (Python):
def check_w(arr):
    a = 0
    if len(arr) % 2 != 0:
        return False
    else:
        for i in range(len(arr)-1):
            a += 1
            if arr[i] != arr[i+1]:
                if a % 2 != 0:
                    return False
                a = 0
    return True

w = list(input())
w.sort()
if check_w(w):
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()
print("Yes" if all([w.count(x)%2 == 0 for x in w]) else "No")

Solution (Python):
import collections
dic = collections.defaultdict(lambda: 0)
for i in list(input()):
    dic[i] += 1

flag = True
for i in dic.keys():
    if dic[i] % 2 != 0:
        flag = False

if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
S=list(input())
S.sort()
alph=list("abcdefghijklmnopqrstuvwxyz")
for i in alph:
    if(S.count(i)%2!=0):
        print("No")
        sys.exit()
        
print("Yes")

Solution (Python):
w=list(input())
x=list(set(w))
y,z=0,0
for i in range(len(x)):
    y=w.count(x[i])
    if y%2==0:
        z+=1
    else:
        print("No")
        break
if z==len(x):
    print("Yes")

Solution (Python):
from collections import Counter
for v in Counter(list(input())).values():
    if v%2!=0: print('No'); exit()
print('Yes')

Solution (Python):
from collections import Counter
c=Counter(raw_input())
l=filter(lambda n:n%2==1, c.values())
if len(l)==0:
	print "Yes"
else:
	print "No"

Solution (Python):
def main():
    w = input()

    for o in range(ord('a'), ord('z')+1):
        c = chr(o)
        if w.count(c) % 2 == 1:
            print("No")
            return

    print("Yes")


if __name__ == '__main__':
    main()

Solution (Python):

"""
https://beta.atcoder.jp/contests/abc044/tasks/abc044_b

"""
import sys
from sys import stdin
from collections import Counter
input = stdin.readline


def solve(w):
    is_beautiful = True
    alphabets = list(w)
    for _, c in Counter(alphabets).most_common():
        if c % 2 != 0:
            is_beautiful = False
            break
    if is_beautiful:
        return 'Yes'
    else:
        return 'No'


def main(args):
    w = input().strip()
    ans = solve(w)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
w=list(input())
s=set(w)
t=0
for i in s:
    if w.count(i)%2==1:
        t=1
        break

if t==1: print("No")
else: print("Yes")

Solution (Python):
from collections import Counter
n = list(input())
for i in range(0,len(n)):
  if n.count(n[i]) % 2 == 1:
    print("No")
    break
  if i == len(n)-1:
    print("Yes")

Solution (Python):
from collections import Counter
w = input().strip()
w_cnt = Counter(w)
for i in w_cnt:
  if w_cnt[i]&1:
    import sys
    print('No')
    sys.exit(0)
print('Yes')

Solution (Python):
w = input()
s = [0]*26
for i in w: s[ord(i)-ord("a")] += 1
for j in s:
    if j%2==1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
N = input()
ans = "Yes"
for i in range(len(N)):
    if N.count(N[i]) % 2 == 1:
        ans = "No"
        break
print(ans)

Solution (Python):
s=list(map(str,input()))
count=0;a=set(s)
for i in a:
    for j in range(len(s)):
        if s[j]==i:
            count+=1
    if count%2!=0:
        print('No')
        exit()
    count=0
print('Yes')

Solution (Python):
w=input()
if all([w.count(c)%2==0 for c in w]):
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter
w = list(input())
cnt = 0
counter = Counter(w)
for _, c in counter.most_common():
    if c%2 == 1:
       print("No")
       break
    else:
       cnt += 1

if cnt == len(set(w)):
   print("Yes")

Solution (Python):
from collections import Counter
w = dict(Counter(input()))

for v in w.values():
    if v % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):

import collections

w = input()


if (all([i % 2 == 0 for i in collections.Counter(w).values()])):
    print("Yes")
else:
    print("No")

Solution (Python):
val = input()
set_val = set(val)

res = True
for i in set_val:
    if val.count(i) % 2 != 0:
        res = False
        break

print("Yes" if res else 'No')

Solution (Python):
import collections
w=input()
dict_i=collections.Counter(w)
if all([i%2==0 for i in dict_i.values()]):
    print("Yes")
else:
    print("No")

Solution (Python):
w=input()
if all([w.count(i)%2==0 for i in w]):
    print("Yes")
else:
    print("No")

Solution (Python):
w=input()
if all([w.count(c)%2==0 for c in w]):
    print("Yes")
else:
    print("No")

Solution (Python):
w=input()
dict={}
for i in w:
  if i not in dict:
    dict[i]=0
  dict[i]+=1
ans=0
for i in dict.values():
  ans+=i%2
if ans==0:
  print('Yes')
else:
  print('No')

Solution (Python):
from collections import Counter
w = input()
c = Counter(w)
ans = "Yes"
k = list(c.items())
for i in range(len(k)):
    if k[i][1] % 2 == 1:
        ans = "No"
print(ans)

Solution (Python):
w = input()

Ans = 0

for i in range(len(w)):
	if  w.count(w[i]) % 2 == 0:
		continue
	else:
		Ans = 1
		break

if Ans == 0:
	print("Yes")
	
else:
	print("No")

Solution (Python):
w=list(input())
ans='Yes'
for i in w:
 s=w.count(i)
 if s%2!=0:
  ans='No'
print(ans)

Solution (Python):
a = input()
ans = "Yes"
for i in range(len(a)):
	if a.count(a[i]) % 2 == 1:
		ans = "No"
		break
print(ans)

Solution (Python):
a = list(input())
ans = "Yes"
for i in range(len(a)):
  if a.count(a[i])%2==1:
    ans = "No"
    break
print(ans)

Solution (Python):
import string
list_ = list(input())
for c in string.ascii_lowercase:
    if list_.count(c) % 2 != 0:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w = input()

def judge(w):
  for c in w:
    if w.count(c) % 2 == 0:
      continue
    else:
      return 'No'
  return 'Yes'

print(judge(w))

Solution (Python):
a = 'abcdefghijklmnopqrstuvwxyz'
w = input()
for i in range(len(a)):
    if w.count(a[i]) % 2 == 1:
        print('No')
        exit()
print('Yes')

Solution (Python):
from collections import defaultdict
w = input()
cnt = defaultdict(lambda: 0)
for c in w:
    cnt[c] += 1

for c in cnt.values():
    if c % 2 != 0:
        print("No")
        exit(0)
print("Yes")

Solution (Python):
w = input()
l = [0]*26
for c in w:
  l[ord(c) - ord("a")] += 1

res = "Yes"
for i in range(26):
  if l[i] % 2 != 0:
    res = "No"

print(res)

Solution (Python):



"""
"""


from collections import ChainMap
from collections import Counter
from collections import defaultdict
from collections import deque
from collections import namedtuple
import bisect
import copy
import decimal
import fractions
import functools
import heapq
import itertools
import math
import operator
import pdb
import pprint
import random
import re
import string
import sys
import time

try:
    import numpy as np
    import scipy as sp
except:
    pass



def is_odd(x):
    return x % 2 == 1

def is_even(x):
    return x % 2 == 0

def cmp(x, y):
    return (x > y) - (x < y)

def sgn(x):
    return cmp(x, 0)

def clamp(x, lo, hi):
    assert lo <= hi
    if x < lo:
        return lo
    elif x > hi:
        return hi
    else:
        return x

def chmax(xmax, x):
    if x > xmax:
        return x, True
    else:
        return xmax, False

def chmin(xmin, x):
    if x < xmin:
        return x, True
    else:
        return xmin, False

def argmax(seq):
    return max(range(len(seq)), key=seq.__getitem__)

def argmin(seq):
    return min(range(len(seq)), key=seq.__getitem__)

def INPUT():
    return input().rstrip() 

sys.setrecursionlimit(100000)



PINF = float("inf")
NINF = float("-inf")
EPS  = 1e-9



def main():
    S = input()
    cnt = Counter(S)

    ok = all(is_even(v) for v in cnt.values())
    print("Yes" if ok else "No")

if __name__ == "__main__": main()

Solution (Python):
w = input()

for i in range(97, 97+26):
  if w.count(chr(i)) % 2 != 0:
    print('No')
    exit()
print('Yes')

Solution (Python):
import string

w = input()
for a in string.ascii_lowercase:
    if w.count(a) % 2:
        print('No')
        exit()
print('Yes')

Solution (Python):
w = list(input())
ans= "Yes"
for i in w:
    if w.count(i) % 2 != 0:
        ans = "No"
print(ans)

Solution (Python):
import collections
w = input()
w_cnt = collections.Counter(w)
jurge = "Yes"
for key in w_cnt:
    if w_cnt[key] % 2:
        jurge = "No"
        break
if jurge == "No":
    print("No")
else:
    print("Yes")

Solution (Python):
import sys
w = input()
for i in range(26):
    c = chr(ord('a') + i)
    if w.count(c) % 2 == 1:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
from collections import Counter
import sys
cnt = Counter(input())
for i in cnt:
    if cnt[i]%2==1:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
a = raw_input().strip()
l = [0]*26
for x in a:
	if l[ord(x)-97] == 1:
		l[ord(x)-97] = 0
	else:
		l[ord(x)-97] =1
if max(l) == 0:
	print('Yes')
else:
	print('No')

Solution (Python):
e = list(input())
ans = 'Yes'
for i in e:
    if e.count(i) % 2 != 0:
        ans = 'No'
print(ans)

Solution (Python):
w = input()
c = [chr(i) for i in range(ord("a"), ord("z")+1)]
for i in c:
  if w.count(i) % 2 == 1:
    print("No")
    exit()
print("Yes")

Solution (Python):
import sys
s=str(input())
for i in range(97,97+26):
  if s.count(chr(i))%2!=0:
    print("No")
    sys.exit()
print("Yes")

Solution (Python):
w=input()

N=len(w)


for i in range(N):
    if w.count(w[i])%2!=0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
W = list(raw_input())
flagArray = [True for i in range(26)]
for w in W:
	flagArray[ord(w)-97] = not(flagArray[ord(w)-97])
flag = True
for f in flagArray:
	if not f:
		print "No"
		flag = False
		break
if flag:
	print "Yes"

Solution (Python):
from collections import defaultdict


def main():
    w = input()
    for s in w:
        if w.count(s) % 2 != 0:
            print("No")
            return
    print("Yes")


if __name__ == '__main__':
    main()

Solution (Python):
w = input()

flag = True

for i in range(len(w)):
    if w.count(w[i]) % 2 != 0:
        flag = False
        break
        
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
w = list(input())

for i in range(len(w)):
    a = w[i]
    ans = w.count(a)
    if ans % 2 == 1:
        print("No")
        break
    elif ans % 2 == 0 and i == len(w)-1:
        print("Yes")

Solution (Python):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(input())
def pli(a): return "".join(list(map(str, a)))

ls = "a b c d e f g h i j k l m n o p q r s t u v w x y z".split()
w = rls()
flag = True
for i in ls:
    count = 0
    for j in w:
        if(j == i):
            count += 1
    if(count % 2 == 1):
        flag = False
        break
print("Yes" if flag else "No")

Solution (Python):
wlist = []
w = input()
for letter in w:
    wlist.append(letter)
a = []
b = []
i = 0
for letter in sorted(wlist):
    if i%2==1:
        a.append(letter)
    else:
        b.append(letter)
    i += 1
if sorted(a) == sorted(b):
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter
print('No' if any(char[1]%2 for char in Counter(input()).items()) else 'Yes')

Solution (Python):
w = input()
exist = {}
for i in w:
    if i not in exist:
        exist[i] = 1
    else:
        exist[i] += 1
answer = "Yes"
for i in exist.values():
    if i%2 != 0:
        answer = "No"
        break
print(answer)

Solution (Python):
from collections import defaultdict
w = raw_input()
d = defaultdict(lambda: 0)
for c in w:
    d[c] += 1
for count in d.values():
    if count % 2 == 1:
        print 'No'
        break
else:
    print 'Yes'

Solution (Python):
def main():
    W = input()

    w = set(W)
    for s in w:
        if W.count(s) & 1:
            ans = 'No'
            break
    else:
        ans = 'Yes'

    print(ans)

main()

Solution (Python):
w = list(raw_input())
M = {}
for c in w:
    if not c in M:
        M[c] = 0
    M[c] += 1
def run():
    for k, v in M.items():
        if v % 2 == 1:
            return "No"
    return "Yes"
print run()

Solution (Python):

w = raw_input()

alphabet = [0]*26
for i in range(len(w)):
    alphabet[ord(w[i])-97] += 1
for i in range(26):
    alphabet[i] = True if alphabet[i]%2 == 0 else False
print ('Yes' if all(alphabet) else 'No')

Solution (Python):
from collections import Counter
w = raw_input()
ct = Counter(w)
f = True
for n in ct.values():
    f &= ((n % 2) == 0)
if f:
    print 'Yes'
else:
    print 'No'

Solution (Python):
w = input()
for c in w:
    cnt = 0
    for t in w:
        if c == t:
            cnt += 1
    if cnt % 2 == 1:
        print("No")
        exit()
print("Yes")

Solution (Python):
w = input()
m = {}
for t in w:
    m[t] = m.get(t, 0) + 1

for key in m:
    if m[key] % 2 == 1:
        print("No")
        exit()

print("Yes")

Solution (Python):
w = input()
m = [0] * 26
for t in w:
    m[ord(t) - ord('a')] += 1

for cnt in m:
    if cnt % 2 == 1:
        print("No")
        exit()

print("Yes")

Solution (Python):
import string
w = input()
for a in string.ascii_lowercase:
    cnt = 0
    for t in w:
        if t == a:
            cnt = cnt + 1
    if cnt % 2 == 1:
        print("No")
        exit()

print("Yes")

Solution (Python):
from collections import Counter
w = input()
C = Counter(w)
for l in C:
	if C[l] % 2:
		print("No")
		break
else:
	print("Yes")

Solution (Python):


import os, sys
import math
from collections import defaultdict
w = raw_input()
m = defaultdict(int)

for i in range(len(w)):
    m[w[i]]+=1
print "Yes" if all([x%2==0 for x in m.values()]) else "No"

Solution (Python):


import os, sys
import math
from collections import defaultdict
w = raw_input()
m = defaultdict(int)

for i in range(len(w)):
    m[w[i]]+=1
b = True
for k,v in m.iteritems():
    b &= (v%2==0)
print "Yes" if b else "No"

Solution (Python):



def input_strs():
    return input().split(" ")

def input_nums():
    return [int(i) for i in input_strs()]


w = input()
ok = True

for c in w:
    p = 0
    for k in w:
        if c == k:
            p += 1
    ok = ok and (p % 2 == 0)

if ok:
    print("Yes")
else:
    print("No")

Solution (Python):
l=[]
re='Yes'
s=raw_input()
for i in s:
    if i not in l:
        if s.count(i)%2!=0:
            re='No'
            break
print re

Solution (Python):
w = input()
mp = dict()
for c in w:
    if c in mp:
        mp[c] += 1
    else:
        mp[c] = 1
ok = True
for k,v in mp.items():
    if v % 2 == 1:
        ok = False
        break
if ok:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input();
for c in S:
	if S.count(c)%2:
		print("No")
		quit()
print("Yes")

Solution (Python):
w = input()


def main(w):
    for c in w:
        if w.count(c) % 2 != 0:
            return 'No'
    return 'Yes'


print(main(w))

Solution (Python):
import sys
from collections import Counter

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

def solve():
    w = input()
    cnt = Counter(w)

    for a in cnt.values():
        if a % 2:
            print('No')
            return 

    print('Yes')


if __name__ == '__main__':
    solve()

Solution (Python):
a=input()
for x in set(a):
    if a.count(x)&1:print('No');exit()
print('Yes')

Solution (Python):


def main():
    w = input()
    for s in w:
        if list(w).count(s) % 2 == 1:
            print('No')
            return
    print('Yes')

if __name__ == '__main__':
    main()

Solution (Python):
S=input()
ans='Yes'
for c in S:
  if S.count(c) % 2 != 0:
    ans='No'
print(ans)

Solution (Python):

import sys
w = input()
for tmp in range (len(w)):
    if w.count(w[tmp])%2 != 0:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
from collections import Counter

w = raw_input()
x = []
f = True
for i in w:
    x.append(i)
counter = Counter(x)
for word,cnt in counter.most_common():
    if not cnt % 2 == 0:
        f = False

if f:
    print 'Yes'
else:
    print 'No'

Solution (Python):
from collections import defaultdict
w = defaultdict(int)
for s in input():
	w[s] += 1

for k in w:
	if w[k] % 2 == 0:
		continue
	else:
		print('No')
		break

else:
	print('Yes')

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7


def main():
    s = input()
    d = collections.defaultdict(int)
    for c in s:
        d[c] += 1
    for c in d.values():
        if c % 2 == 1:
            return 'No'
    return 'Yes'



print(main())

Solution (Python):
import numpy as np
import sys
ss=list(input())
s=np.array(ss)
s.sort()
count=1
for i in range(1,len(s)):
    if s[i]==s[i-1]:
        count+=1
    else:
        if count%2==0:
            count=1
        else:
            print("No")
            sys.exit()
if count%2!=0:
    print("No")
    sys.exit()
print("Yes")

Solution (Python):
import sys
s=list(input())
s.sort()
count=1
for i in range(1,len(s)):
    if s[i]==s[i-1]:
        count+=1
    else:
        if count%2==0:
            count=1
        else:
            print("No")
            sys.exit()
if count%2!=0:
    print("No")
    sys.exit()
print("Yes")

Solution (Python):
def f(w):
    for c in set(w):
        if w.count(c) % 2 != 0:
            return "No"
    return "Yes"
    
w = raw_input()
print f(w)

Solution (Python):


from collections import defaultdict

letters = str(input())


d = defaultdict(int) 
for letter in letters:
    d[letter] += 1
    
k = 0
for values in d.values():
    if values % 2 == 0:
        k += 0
    else:
        k +=1

if k == 0:
    print('Yes')
else:
    print('No')

Solution (Python):

def checkValue(count):
    for v in count.values():
        if v % 2 != 0:
            return 'No'
    return 'Yes'

if __name__ == "__main__":
    w = input()

    count = {}

    for i in range(len(w)):
        if w[i] in count:
            count[w[i]] = count[w[i]] + 1
        else:
            count[w[i]] = 1

    print(checkValue(count))

Solution (Python):
import sys

string = input()

counter = {}
for c in string:
    if not c in counter:
        counter[c] = 1
    else:
        counter[c] += 1

for v in counter.values():
    if v % 2 != 0:
        print("No")
        sys.exit()

print("Yes")

Solution (Python):
from collections import Counter


def main():
    w = input()
    c = Counter(w)

    for k, v in c.items():
        if v % 2 != 0:
            print("No")
            return
    print("Yes")


if __name__ == '__main__':
    main()

Solution (Python):
import sys
w = list(input())
w.sort()

if len(w) == 1:
    print("No")
    sys.exit()

count = 1
for i in range(1, len(w)):
    if w[i] == w[i-1] :
        count += 1
    else:
        if count % 2 == 1:
            print("No")
            sys.exit()
        count = 1

print("Yes")

Solution (Python):
w = input()
characters = list(w)
for character in characters:
    if characters.count(character) %2 != 0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
import sys

w = sys.stdin.readline()

c = 'a'

for i in xrange(ord('a') - ord('A')):
    if w.count(chr(ord(c) + i)) % 2 == 1:
        print 'No'
        break
else:
    print 'Yes'