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):
w=str(input())
L=['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']
p=0
for i in range(26):
    num=w.count(L[i])
    if num%2==0:
        p+=1
if p==26:
    print('Yes')
else:
    print('No')

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

Solution (Python):


w = input()

def isbeautiful(w):
    for a in [chr(ord('a')+i) for i in range(26)]:
        if w.count(a) % 2 != 0:
            return False
    return True

print('Yes' if isbeautiful(w) else 'No')

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

Solution (Python):
s,ans=input(),0;a=[s[i]for i in range(len(s))];a.sort()
for i in a:
  if a.count(i)%2!=0:ans=1
if ans==0:print("Yes")
else:print("No")

Solution (Python):
String = str(input())




result = {}
for char in String:
    try:
        result[char] += 1
    except KeyError:
        result[char] = 1

result = list(map(lambda x: x % 2, list(result.values())))
if result == [0] * len(result):
    print('Yes')
else:
    print('No')

Solution (Python):
String = str(input())

result = {}
for char in String:
    try:
        result[char] += 1
    except KeyError:
        result[char] = 1

result = list(map(lambda x: x % 2, list(result.values())))
if result == [0] * len(result):
    print('Yes')
else:
    print('No')

Solution (Python):
import collections


W = input()
c = collections.Counter(W)
cm = c.most_common()

ans = 'Yes'
for v in cm:
    if v[1]%2 != 0:
        ans = 'No'

print(ans)

Solution (Python):

import collections
S =list(input())
ANS = 0
counter = collections.Counter((S))
for _ in set(S):
    if counter[_] %2 ==0:
        ANS +=1
if ANS ==len(set(S)):
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter

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

for value in w.values():
    if value % 2:
        ans = 'No'
        break
print(ans)

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

Solution (Python):



def main():
    w = input()
    s = [i for i in w]
    for i in s:
        if w.count(i)%2 != 0:
            print('No')
            exit(0)
    print('Yes')


if __name__ == '__main__':
    main()

Solution (Python):
w = input()
print('Yes') if sum([int(w.count(chr(x))%2) for x in range(97,97+26)])==0 else print('No')

Solution (Python):
from collections import Counter
print('Yes' if all(x % 2 == 0 for x in Counter(input()).values()) else 'No')

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

x = set(w)

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

print('Yes')

Solution (Python):
w = input()
dic = {}
for c in w:
    dic[c] = dic.get(c,0)+1
for k in dic:
    if dic[k]%2==1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
word=input()
list=set(word)
T=True
for i in list:
  if word.count(i)%2==1:
    T=False
if T==True:
  print("Yes")
else:
  print("No")

Solution (Python):
alpha=["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"]
word=input()
T=True
for i in alpha:
  if word.count(i)%2==1:
    T=False
    break
if T==True:
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
flg='Yes'
ss = set(s)
for c in list(ss):
  if s.count(c) % 2 != 0:
    flg='No'
    break
print(flg)

Solution (Python):
def beautiful(w):
    t = set(w)
    s = [w.count(i) for i in t]
    for i in s:
        if i%2 != 0:
            return 'No'
    return 'Yes'
w = input()
print(beautiful(w))

Solution (Python):
from collections import Counter
c=Counter(input())
flag=0
for key in c:
  if c[key]%2:
    flag=1
if flag:
  print("No")
else:
  print("Yes")

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

Solution (Python):
w = input()

from collections import Counter

cs = Counter(w)

result = all(cs[c] % 2 == 0 for c in cs)

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

Solution (Python):

"""
Created on Fri Mar 15 09:40:47 2019

@author: 17664
"""

s = input()

alphaList = list(set(s))

cnt = 0
ans = 'Yes'

for i in alphaList:
    cnt = s.count(i)
    if cnt % 2 != 0:
        ans = 'No'
        break
    else:
        cnt = 0
        
print(ans)

Solution (Python):
w = input()
a = set(w)
b = []

for i in a:
  if w.count(i) % 2 == 0:
    b.append(0)
  else:
    b.append(1)
if 1 in b:
  print("No")
else:
  print("Yes")

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

Solution (Python):
from collections import Counter

import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
w = input()[:-1]
C = Counter(w)
if all(v % 2 == 0 for v in C.values()):
    print("Yes")
else:
    print("No")

Solution (Python):
s=input();print("YNeos"[any(s.count(i)%2for i in s)::2])

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
from operator import itemgetter

def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")

def ip():
    return int(input())



a = input()                                  







s = set()
for i in range(len(a)):
    s.add(a[i])
s = list(s)
for i in range(len(s)):
    b = a.count(s[i])
    if b%2:j(0)
j(1)

Solution (Python):
li = list(str(input()))

li1 = [x for x in set(li) if li.count(x) % 2 == 0]
li2 = list(set(li))

if li1 == li2:
    print("Yes")

else:
    print("No")

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

Solution (Python):
w = input()

occ = {}
for ch in w:
    if not ch in occ:
        occ[ch] = 0
    occ[ch] += 1
ans = True
for v in occ.values():
    if v % 2 == 1:
        ans = False

print("Yes" if ans else "No")

Solution (Python):
""" AtCoder """

w = list(input())

w.sort()

if len(w) % 2 == 1:
    print("No")
    exit()

for i in range(0, len(w)//2 + 1, 2):
    if w[i] != w[i+1]:
        print("No")
        exit()

print("Yes")

Solution (Python):



n=input()
d=["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"]
if len(n)%2==1:
    print("No")
else:
    flag=0
    ans="Yes"
    for i in range(26):
        if flag==0:
            count=0
            for j in range(len(n)):
                if n[j]==d[i]:
                    count+=1
            if count%2==1:
                flag=1
                ans="No"
                break
        else:
            break

    print(ans)

Solution (Python):
w = list(input().rstrip())
t = {}
for i in range(len(w)):
    k = w[i]
    if k in t:
        t[k] += 1
    else:
        t[k] = 1


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

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

Solution (Python):
s = input()
alph = "abcdefghijklmnopqrstuvwxyz"
for i in range(26):
  if s.count(alph[i])%2 ==1:
    print("No")
    exit()
print("Yes")

Solution (Python):
s=input()
ss=set(s)
l=[s.count(c)%2 for c in ss]
print('No' if sum(l) else 'Yes')

Solution (Python):
N=input()
for i in N:
  if N.count(i)%2==0:
    pass
  else:
    print("No")
    exit()
print("Yes")

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

Solution (Python):
import string
w = input()

if all([(w.count(i)+1) % 2 for i in string.ascii_lowercase]):
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
w = input()
alpha = [chr(i) for i in range(97, 97+26)]
for c in alpha:
  n = w.count(c)
  if (n % 2):
    print('No')
    sys.exit()
print('Yes')

Solution (Python):
import re

list = input()
list_set = set(list)
for set_string in list_set:
    cheak = re.findall(set_string, list)
    if len(cheak) % 2 ==0:
        continue
    else:
        print('No')
        exit()
print('Yes')

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

Solution (Python):
w = list(str(input()))
x = list(set(w))
flag = 0
for i in range(len(x)):
  flag += (w.count(x[i]))%2
if flag == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
wlist = list(input())
counter = {}
for i in wlist:
    if i in counter:
        counter[i] += 1
    else:
        counter[i] = 1

a = list(counter.values())

if all(elem %2 ==0 for elem in a):
    print("Yes")
else:
    print("No")

Solution (Python):
a = input()  
b = set(a)  

c = 0
for i in b:
    if a.count(i) % 2 == 1:  
        c = 1
        break
        
if c == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
cnt ={}
flg = True
for s in S:
    if s not in cnt.keys():
        cnt[s]=1
    else:
        cnt[s]+=1
for i in cnt.values():
    if i % 2 !=0:
        flg = False
print('Yes' if flg else 'No')

Solution (Python):
w=input()
al=[0]*26
def amari(a):
    return a%2
for i in range(len(w)):
    al[ord(w[i])-97]+=1
ans=list()
ans=map(amari,al)
print('No'if 1 in ans else "Yes"  )

Solution (Python):
w=[i for i in input()]
result=True
for i in range(len(w)):
    if w.count(w[i])%2==1:
        result=False
        break
print("Yes" if result else "No")

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

Solution (Python):
w = input()
dic = {}
for i in range(ord('a'), ord('z')+1):
    dic[chr(i)] = 0
for s in w:
    dic[s] += 1
print('Yes') if all([v % 2 == 0 for v in dic.values()]) else print('No')

Solution (Python):
S=input()
cnt ={}
flg = True
for s in S:
    if s not in cnt.keys():
        cnt[s]=1
    else:
        cnt[s]+=1
for i in cnt.values():
    if i % 2 !=0:
        flg = False
print('Yes' if flg else 'No')

Solution (Python):
import collections,sys
w = list(input())
c = collections.Counter(w)
for s,num in c.items():
    if num%2 != 0:
        print('No')
        sys.exit()
print('Yes')

Solution (Python):

S = input()
cnt = {}
flg = True
for s in S:
  if s not in cnt:
    cnt[s] = 1
  else:
    cnt[s] += 1
for i in cnt.values():
  if i % 2 != 0:
    flg = False
print('Yes' if flg else 'No')

Solution (Python):
w = input()
w = list(w)
w.sort()
judge = 1

if(len(w)%2 == 1):
  print('No')
else:
  for i in range(int(len(w)/2)):
    if(w[2*i] != w[2*i+1]):
      judge = 0
      break

  if(judge == 1):
   print('Yes')
  else:
   print('No')

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

Solution (Python):
import sys
w=input()
l=[w[i] for i in range(len(w))]
l.sort()
m=[0]*26
m[0]+=1
i=0
v=0
for i in range(1,len(w)):
    if l[i] in l[:i]:
        m[v]+=1
    else:
        v+=1
        m[v]+=1
    i+=1
for c in m:
    if c%2==1:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
w = list(input())
for c in w:
    if w.count(c) % 2 != 0:
        print('No')
        exit()

print('Yes')

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

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

Solution (Python):
w = input()
result = []
for alp in 'abcdefghijklmnopqrstuvwxyz':
  if(w.count(alp)%2 != 0):
    print('No')
    break
else:
  print('Yes')

Solution (Python):
w = input()
W = []
for i in w:
    W.append(i)
ans = "Yes"
for i in set(W):
    if W.count(i) % 2 != 0:
        ans = "No"

print(ans)

Solution (Python):
from collections import Counter
w = list(input().rstrip())
c = Counter(w)
if all([True if cnt[1] % 2 == 0 else False for cnt in c.items()]):
    print('Yes')
else:
    print('No')

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

Solution (Python):
s=input()
c=0
for i in s:
  if s.count(i)%2 != 0:
    c=1
print("YNeos"[c::2])

Solution (Python):
a = input()
b=set(a)
bool = True
for i in b:
    if a.count(i)%2!=0:
        bool = False
if bool:
    print("Yes")
else:
    print("No")

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

alpha = [chr(i) for i in range(97,97+26)]
cnt = [0]*26

for i in w:
    cnt[ord(i)-97] += 1
res = 'Yes'
for i in cnt:
    if i%2 != 0:
        res = 'No'
print res

Solution (Python):


w=input()
s=set(w)
r=True
for i in s:
  if w.count(i)%2==1:
    r=False
if r:
  print('Yes')
else:
  print('No')

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

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

flg = True

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

print("Yes" if flg else "No")

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

Solution (Python):
s = sorted(input())
count = 0

if len(s)%2 == 1:
    print('No')

else:
    for i in range(0, len(s), 2):
        if s[i] == s[i+1]:
            continue
        else:
            count += 1

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

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

if __name__ == '__main__':
  main()

Solution (Python):
w=input()
s=[0]*123
for i in range(len(w)):
    s[ord(w[i-1])]+=1
c=1
for i in range(97,97+26):
    if s[i]%2==1:
        c=0
        break
if c==1:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
p=list(set(list(s)))
a=[]
for i in p:
    a.append(s.count(i))
for x in a:
    if x%2!=0:
        print("No")
        exit()
print("Yes")

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

Solution (Python):
w=str(input())
w2=set(w)
flag=0
for i in w2:
    cnt=0
    cnt=w.count(i)
    if cnt%2==1:
        print("No")
        flag=1
        break
if flag==0:
    print("Yes")

Solution (Python):
w = input()
x = set(w)
ans = 'Yes'
for i in x:
    if w.count(i) % 2 == 1:
        ans = 'No'
        break
print(ans)

Solution (Python):
w = input()
c={}
for i in range(len(w)):
    if not w[i] in c:
        c[w[i]] =0
    c[w[i]] +=1

ans = "Yes"
for k in c.keys():
    if c[k] %2 !=0:
        ans = "No"

print(ans)

Solution (Python):
w=sorted(input())
s=list(set(w))
for i in range(len(s)):
    if(w.count(s[i])%2 == 0):
        continue
    else:
        print('No')
        exit()
print('Yes')

Solution (Python):
S = input()

SS = list(set(S))
num = []
for i in range(len(SS)):
    num.append(S.count(SS[i]))
if all(n%2==0 for n in num):
    print('Yes')
else:
    print('No')

Solution (Python):
import collections
a=list(input())
d=collections.defaultdict(str)
for s in a:
    if s not in d:
        d[s]=1
    else:
        d[s]+=1
c=0
for t in dict(d).values():
    if t%2!=0:
        print("No")
        exit()
print("Yes")

Solution (Python):
from collections import Counter
lst=[]
for i in input():
    lst.append(i)
for j in Counter(lst).values():
    if j%2 != 0:
        print("No")
        exit()
print("Yes")

Solution (Python):
w = input()
dic = {}
flag = True

for wd in w:
  if wd not in dic:
    dic[wd] = 0
  dic[wd] += 1
  
for dicw in dic:
  if dic[dicw] % 2 == 1:
    flag = False
    break
    
if flag == True:
  print('Yes')
else:
  print('No')

Solution (Python):
w = input()
d = {}
for i in range(len(w)):
    if w[i] in d:
        d[w[i]] += 1
    else:
        d[w[i]] = 1
        
res = 'Yes'
for key in d:
    if d[key]%2 != 0:
        res ='No'
print(res)

Solution (Python):
w=input()
w_list=list(w)
for a in w_list:
    if w_list.count(a)%2==0:
        ans=True
    else:
        print('No')
        exit()
print('Yes')

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

Solution (Python):
w = input()

se = set()
for s in w:
    if s in se:
        se.remove(s)
    else:
        se.add(s)

ans = 'Yes' if len(se) == 0 else 'No'

print(ans)

Solution (Python):
a=list(input())
b=[]
for i in range(len(a)):
    if a[i] in b:
        b.remove(a[i])
    else:
        b.append(a[i])
print('Yes' if b==[] else 'No')

Solution (Python):
import collections
Sigma = list("abcdefghijklmnopqrstuvwxyz")
w = list(input())
c = collections.Counter(w)
for _ in Sigma:
    if c[_] % 2:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
char_cnt = {}
for c in input():
    if c in char_cnt:
        char_cnt[c] += 1
    else:
        char_cnt[c] = 1
print("Yes" if all([v % 2 == 0 for v in char_cnt.values()]) else "No")

Solution (Python):
w = input()

w_dict = {}
for a in range(len(w)):
    if w[a] not in w_dict:
        w_dict[w[a]] = 1
    else:
        w_dict[w[a]] += 1

checker = ''
for a in w_dict.values():
    if not a % 2 == 0:
        checker += '*'
        break

if checker == '':
    print('Yes')
else:
    print('No')

Solution (Python):
X=input()
counts={}
for I in X:
     counts[I]=counts.get(I,0)+1
items=list(counts.items())
for K in range(len(items)):
     word,count=items[K]
     if count%2!=0:
          print("No")
          break
else:
     print("Yes")

Solution (Python):
import string
import collections
w = input()
w2 = collections.Counter(w)
query = string.ascii_lowercase
ans = 'Yes'
for i in query:
  if w2[i]%2 == 1:
    ans ='No'
print(ans)

Solution (Python):
listW = list(input())
listW.sort()
counter=0
bef=0
index=0
flag=0
while index < len(listW):
    if index==0:
        bef=listW[index]
        counter=1
    elif listW[index]==bef:
        counter+=1
    else:
        if counter%2==0:
            bef=listW[index]
            counter=1
        else:
            flag=1
            break
    index+=1

if flag==0 and len(listW)%2==0:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()
w_base = set(w)

for i in w_base:
    if w.count(i) % 2 == 1:
        print('No')
        exit()
print('Yes')

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

Solution (Python):
alpha=[0]*26
w=input()
for i in range(len(w)):
    alpha[ord(w[i])-ord('a')]+=1
ans=0
for i in range(26):
    if alpha[i]%2!=0:
        ans=1
if ans==0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
w = input()
dic = {}
for c in w:
    if c in dic:
        dic[c] += 1
    else:
        dic[c] = 1

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

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

Solution (Python):
s=input();print('YNeos'[any(s.count(t)%2for t in s)::2])

Solution (Python):
s=input();print('YNeos'[any(s.count(t)%2for t in s)::2])

Solution (Python):
w=str(input())
alpha='abcdefghijklmnopqrstuvwxyz'
def main(w):
    for j in range(len(alpha)):
        if w.count(alpha[j])%2==1:
            return 'No'
    return 'Yes'
print(main(w))

Solution (Python):
from collections import Counter
w = input()
c = Counter(w).values()
ans = "Yes"
for e in c:
    if e % 2 == 1:
        ans = "No"
        break
print(ans)

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

Solution (Python):
from collections import Counter
import sys
m =input()

m_list =  list(m)

m_dict = Counter(m_list)

ans_list = m_dict.values()
for i,e in enumerate(ans_list):
    if e%2 !=0:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
import sys


S = str(input())


t = {}
for s in S:
    if not(s in t):
        t[s] = 1
    else:
        t[s]+=1

ans = [n % 2 for n in t.values()]
print("Yes" if 1 not in ans else "No")

Solution (Python):
import collections

def mod(x):
  return x % 2

a = input()
b = list(a)

c = collections.Counter(b)

countc = c.values()

modc = map(mod, countc)

if 1 in modc:
  print('No')
else:
  print('Yes')

Solution (Python):
def execute(w):
    if len(w) % 2 == 1:
        return 'No'

    for i in range(len(w) // 2):
        if w.count(w[i]) % 2 == 1:
            return 'No'
    return 'Yes'


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

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

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

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

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

Solution (Python):
w=input()
wl=list(w)
ws=set(wl)
for i in ws:
    if w.count(i)%2==1:
        print("No")
        exit()
print("Yes")

Solution (Python):

w = input()
dic = {chr(i+ord('a')): 0 for i in range(0, 26)}
for c in w:
    dic[c] += 1

result = 'No'
for i in range(26):
    if dic[chr(i+ord('a'))] % 2 != 0: break
else: result = 'Yes'
print(result)

Solution (Python):
w = str(input())
count = 1
for i in range(len(w)):
    s = w.count(w[i])
    if s % 2 != 0:
        print("No")
        count -=1
        break
if count == 1:
    print("Yes")

Solution (Python):
from collections import Counter
W = input()

Ans = "Yes"

C = Counter(W).items()
for c in C:
    _x,cnt = c
    if cnt%2 != 0:
        Ans = "No"
        break

print(Ans)

Solution (Python):
w = input()
alpha_dict = {i: w.count(i) for i in w}
for i in alpha_dict.values():
    if i % 2 != 0:
        print("No")
        exit()
print("Yes")

Solution (Python):
w = input()
alpha_dict = {}
for i in w:
    alpha_dict[i] = w.count(i)
for i in alpha_dict.values():
    if i % 2 != 0:
        print("No")
        exit()
print("Yes")

Solution (Python):
from collections import Counter
S = Counter(list(input()))
for k, v in S.items():
  if v % 2 == 1:
    print("No")
    exit()
print("Yes")

Solution (Python):
import collections

f = list(filter(lambda n: n % 2 == 1, collections.Counter(input()).values()))
print('Yes' if len(f) == 0 else 'No')

Solution (Python):
w = list(input())
count=0
for i in range(97, 123):
    if(w.count(chr(i))%2!=0):
        print("No")
        count+=1
        break
if(count==0):
    print("Yes")

Solution (Python):
w = input()

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

Solution (Python):
import collections
w = input()
c = collections.Counter(w)
for i in c:
    if c[i] % 2 != 0:
        print("No")
        exit()
print("Yes")

Solution (Python):
w = input()
d = dict()
for s in w:
    d[s] = 0

for s in w:
    d[s] += 1

for v in d.values():
    if v % 2 != 0:
        print("No")
        break
else:
    print("Yes")

Solution (Python):



def main():
    from collections import Counter

    w = Counter(list(input()))

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

    print('Yes')


if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter as c
w=c(input())
f=0
for m in range(97,123):
  if(w[chr(m)]%2>0):f=1;break
print("YNeos"[f::2])

Solution (Python):
import collections
l = list(input())
c = collections.Counter(l)
a = list(c.items())
r = 1
for i in range(len(a)):
    if a[i][1]%2!=0:
        r = 0
if r:
    print("Yes")
else:
    print("No")

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

Solution (Python):
s=0
for c in input():s^=1<<ord(c)
print('YNeos'[s>0::2])

Solution (Python):
s=0
for c in input():s^=1<<(ord(c)-97)
print(['Yes','No'][s>0])

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

Solution (Python):
w = input()
mp = dict()

for c in w:
    if c in mp:
        mp[c] += 1
    else:
        mp[c] = 1

def check(w):
    c = "Yes"
    for i in w:
        if i % 2 == 0:
            continue
        else:
            c = "No"
            break
    return c

print(check(mp.values()))

Solution (Python):
w = input()
alp = "abcdefghijklmnopqrstuvwxyz"

def check(w):
    c = "Yes"
    for i in alp:
        if w.count(i)%2 == 0:
            continue
        else:
            c = "No"
            break
    return c

print(check(w))

Solution (Python):
w=list(input())
w.sort()
print("Yes" if w[::2]==w[1::2] else "No")

Solution (Python):
w = input()
n = len(w)
alpha = [chr(i) for i in range(ord('a'), ord('z')+1)]

all_even = True
for i in range(26):
    cnt = 0
    for j in range(n):
        if alpha[i] == w[j]:
            cnt += 1
    if cnt % 2 != 0:
        all_even = False

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

Solution (Python):
w = list(input())
counter = 0
for _ in w:
    if w.count(_)%2 == 0:
        counter += 1
    else:
        print("No")
        break
    if counter == len(w):
        print("Yes")

Solution (Python):
s = input().rstrip()
s = sorted(s)
while True:
    if len(s) == 0:
        print("Yes")
        break
    l = s.count(s[0])
    if l % 2 != 0:
        print("No")
        break
    else:
        for i in range(l):
            s.remove(s[0])

Solution (Python):
w=list(input())
a=list(set(w))
for i in a:
  if w.count(i)%2:
    print('No')
    exit()
print('Yes')

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

Solution (Python):
from collections import Counter

w = list(input())
count = Counter(w)

flag = True
for i in count.values():
    if i % 2 != 0:
        flag = False

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

Solution (Python):
import collections

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

Solution (Python):
import sys

l=list(input())

for i in range(97, 97+26):
  if l.count(chr(i))%2!=0:
    print("No")
    sys.exit()

print("Yes")

Solution (Python):
ws=list(input())
ws.sort()
print('Yes' if ws[::2] == ws[1::2] else 'No')

Solution (Python):
w = input()
for x in w:
    if w.count(x) % 2 == 0:
        pass
    else:
        break
else:
    print("Yes")
    exit()
print("No")

Solution (Python):
import collections
w = input()
c = collections.Counter(w)
result = 'Yes'
for v in c:
    if c[v] % 2 != 0:
        result = 'No'
print(result)

Solution (Python):
w = input()
words = list(set(w))
cnt = 0
for word in words:
  if(w.count(word)%2 == 0):
    cnt += 1 
if(cnt == len(words)):
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
    chars = dict()
    for c in input():
        if not c in chars:
            chars[c] = 1
        else:
            chars[c] += 1

    if all(v % 2 == 0 for v in chars.values()):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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

Solution (Python):
_w = input()
w = [_w[i] for i in range(len(_w))]
if len(w) % 2 == 1:
    print("No")
    exit()
w.sort()
for i in range(int(len(w)/2)):
    if w[i*2] != w[i*2+1]:
        print("No")
        exit()
print("Yes")

Solution (Python):
s = input()

d = set()
for i in s:
  if i in d:
    d.remove(i)
  else:
    d.add(i)
if d == set():
  print('Yes')
else:
  print('No')

Solution (Python):
import sys

w=input()

from collections import Counter
counter=Counter(w)

for i in counter.values():
    if i%2==1:
        print("No")
        sys.exit()

print("Yes")

Solution (Python):
cnt = [0] * 26
s = input()
for c in s:
  cnt[ord(c) - ord('a')] += 1
ans = True
for c in range(26):
  if cnt[c] % 2 != 0:
    print('No')
    exit(0)
print('Yes')

Solution (Python):
w = input()
A = [0]*26
for v in w:
    A[ ord(v) - ord('a')] = ( A[ ord(v) - ord('a')] + 1)%2
if sum(A) > 0:
    print('No')
else:
    print('Yes')

Solution (Python):
s=input()
d={}
for i in s:
    if i in d: d[i]+=1
    else: d[i]=1
ans=0
for i in d:
    if d[i]%2:
        ans=1
print("No" if ans else "Yes")

Solution (Python):
w = list(input())
wd = {s:0 for s in w}
for s in w:
    wd[s] += 1
for d in wd.values():
    if d % 2 != 0:
        print("No")
        exit()
print("Yes")

Solution (Python):
import collections
import sys

line = input()
c = collections.Counter(line)

for i in c.values():
    if i % 2 != 0:
        print('No')
        sys.exit()

print('Yes')

Solution (Python):
import sys
W = input()

set_w = set(W)

for i in set_w:
    if W.count(i) % 2 != 0:
        print("No")
        sys.exit()

print("Yes")

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

Solution (Python):
import collections
w = list(input())
a = collections.Counter(w)
check = True
for i in a:
    if a[i]%2 != 0:
        check = False
if check:
    print("Yes")
else:
    print("No")

Solution (Python):
s=list(input())
s.sort()
t=set(s)
t=list(t)
flag=0
for i in range(len(t)):
  if s.count(t[i])%2==1:
    flag=1
print('Yes' if flag==0 else 'No')

Solution (Python):
count = [0] * 26
for c in input():
    count['abcdefghijklmnopqrstuvwxyz'.index(c)] += 1
for n in count:
    if n % 2:
        print('No')
        exit()
print('Yes')

Solution (Python):

w = input()

ans = 0

for c in list(set(w)):
    if w.count(c) % 2 == 1:
        ans += 1

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

Solution (Python):
import collections
S = list(input())
counter = collections.Counter(S)

is_pretty = True
for v in counter.values() :
	if v % 2 != 0 :
		is_pretty = False

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

Solution (Python):
moji = list(input())
mojiset = list(set(moji))

for moj in mojiset:
  if moji.count(moj) %  2 != 0:
    print("No")
    break
else:
  print("Yes")

Solution (Python):
from collections import Counter
w = Counter(input()).most_common()
for _, i in w:
  if i % 2 !=0:
    print('No')
    exit()
print("Yes")

Solution (Python):
import collections

w=input()
c=collections.Counter(w)

keys=[k for k , v in c.items() if v%2!=0]


if(len(keys)==0):
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter

flag = True
w = input()
c = Counter(w)

l = c.most_common()

for e in l:
    if e[1] % 2 != 0:
        flag = False
        break
        
if flag:
    print('Yes')
else:
    print('No')