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 = input()
dic = {}
for i in range(len(w)):
    dic[w[i]] = w.count(w[i])

a = list(dic.values())
c = 0
for i in range(len(a)):
    c += a[i]%2
print("Yes" if c == 0 else "No")

Solution (Python):
w = input()
dic = {}
for i in range(len(w)):
    dic[w[i]] = w.count(w[i])

a = list(dic.values())
a = [n%2 for n in a]
c = 0
for i in range(len(a)):
    c += a[i]
print("Yes" if c == 0 else "No")

Solution (Python):
import string
str = input()
ans = 'Yes'
for char in string.ascii_lowercase:
    if str.count(char) % 2 == 1:
        ans = 'No'
        break
print(ans)

Solution (Python):

import sys


def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

w = list(IS())
set_w = set(w)
for s in set_w:
    if w.count(s)%2 != 0:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w = input()
if not any([w.count(s) % 2 for s in set(w)]):
    print("Yes")
else:
    print("No")

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

Solution (Python):
from collections import Counter
n = input()
c_nn = Counter(n)
for i in c_nn.values():
  if i%2 != 0:
    print("No")
    break
  else:
    print("Yes")
    break

Solution (Python):
text = input()
count_dict = {}
for ch in text:
  if ch not in count_dict:
    count_dict[ch] = 1
  elif ch in count_dict:
    count_dict[ch] += 1

flag = True
for num in count_dict.values():
  if num % 2 == 0:
    pass
  elif num % 2 == 1:
    flag = False
    
if flag:
  print('Yes')
else:
  print('No')

Solution (Python):
dic = {}
s = input()
cue = 0
for i in s:
    if i in dic:
        dic[i] += 1
    else:
        dic[i] = 1

for i in dic:
    if dic[i] % 2 != 0:
        cue = 1
        break

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

Solution (Python):
import sys
from collections import deque, Counter

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

w = input()
c = Counter(w)
ans = 'Yes'
for i in c.values():
    if i % 2 != 0:
        ans = "No"
print(ans)

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

Solution (Python):
import string

s = input()
if all([s.count(c) % 2 == 0 for c in string.ascii_lowercase]):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
print('Yes' if [s.translate(str.maketrans(i,"" or "a")) for i in s if s.count(i)%2 != 0] == [] else 'No')

Solution (Python):
from collections import Counter
 
w = input()
 
char_counter = Counter()
 
for c in w:
  char_counter[c] += 1
 
is_beautiful = "Yes"
for c in char_counter.most_common():
  if c[1] % 2 == 1:
    is_beautiful = "No"
 
print(is_beautiful)

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

Solution (Python):
def main():
  s = raw_input()
  memo = {}
  for c in s:
    if c not in memo:
      memo[c] = 0
    memo[c] += 1
  
  result = True
  for x in memo.values():
    if x % 2 > 0:
      result = False
      break
  print("Yes" if result else "No")

main()

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

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

Solution (Python):
s = input()

import collections as cl
dic = cl.Counter(s)

def is_beautiful(dic):
  for val in dic.values():
    if val % 2 != 0:
      return False
  return True

if is_beautiful(dic):
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
import collections
W = input()
c = collections.Counter(W)
answer = 'Yes'
for w in c:
    if c[w] % 2 == 1:
        answer = 'No'
print(answer)

Solution (Python):
a = "abcdefghijklmnopqrstuvwxyz"
w = input()
f = 0
for c in a:
    d = w.count(c)
    if d % 2 != 0:
        f = 1
        break
if f == 1:
    print("No")
else:
    print("Yes")

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


if __name__ == "__main__":
    test()

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

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

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

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

Solution (Python):



w = input()


ans = True
for i in range(len(w)):
    if len(w) != 0:
        tmp = w[0]
        count = w.count(tmp)
        w = w.replace(tmp, '')
        if count % 2 != 0:
            ans = False
    else:
        break


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

Solution (Python):
def main():

    w = input()
    d = dict()
    for c in w:
        d[c] = d.get(c, 0) + 1
    for c in d:
        if d[c] % 2 != 0:
            return "No"
    return "Yes"

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

Solution (Python):
w = input()

ans=True

for i in w:
  if w.count(i) % 2 ==1 :
    ans = False

if ans == True:
  print("Yes")
else:
  print("No")

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

Solution (Python):
from collections import Counter

w = input()
c = Counter(w)
flag=True
for i in c.values():
    if i%2==0:
        continue
    else:
        flag=False
        break
print('Yes' if flag else 'No')

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

Solution (Python):
s = input()

print('Yes' if all([s.count(char) % 2 == 0 for char in s]) else 'No')

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

Solution (Python):
words = list(input())
li = {}
for w in words:
  if w in li:
    li[w] += 1
  else:
    li[w] = 1
for i in li.values():
  if i % 2 == 1:
    print('No')
    exit()
print('Yes')

Solution (Python):
w = input()
alp = ["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"]

for i in alp:
    if w.count(i)%2 != 0:
        ans = 0
        break
    else:
        ans= 1
print("Yes" if ans == 1 else"No")

Solution (Python):
a=sorted(input())
b=0
for i in range(len(a)-1):
  if i%2==0 and a[i]!=a[i+1]:
    b=1
if len(a)%2==1:
  b=1
print("Yes" if b==0 else "No")

Solution (Python):
a=list(input())
sum=0
b=list(set(a))
for i in range(len(b)):
  if a.count(b[i])%2==0:
    sum+=1
print("Yes" if sum==len(b) else "No")

Solution (Python):
from collections import Counter

c = Counter(input())
valid = True
for key, value in c.items():
    if value % 2 == 1:
        valid = False
        break
if valid:
    print("Yes")
else:
    print("No")

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

Solution (Python):
w = input()
import collections
W = collections.Counter(w)
V = list(W.values())
f = True
for v in V:
  if v%2 == 1:
    f = False
if f:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 




 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    w = input()
    dic = {}
    
    for i in w:
        if i in dic:
            dic[i] += 1
        else:
            dic[i] = 1
            
    for i in dic.values():
        if i % 2 == 1:
            print("No")
            sys.exit()
            
    print("Yes")
    
if __name__ == "__main__":
	main()

Solution (Python):
a=input()
while(True):
  if len(a)==0:
    print('Yes')
    break;
  elif a.count(a[0])%2==0:
    a=a.replace(a[0],'');
  else:
    print('No')
    break;

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

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

Solution (Python):
s = [0 for i in range(26)]
w = input()

for i in w:
  s[ord(i)-ord("a")] += 1

f = True
for i in s:
  if i % 2 == 1:
    f = False
    break

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

Solution (Python):
w = list(input())
atoz = [0 for i in range(26)]

for char in w:
    atoz[ord(char) - ord('a')] += 1

odd_flag = 0
for count in atoz:
    if count % 2 == 1:
        odd_flag = 1
        break

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

Solution (Python):
if __name__ == "__main__":
    l = list(input())
    s = set(l)

    for v in s:
        if l.count(v) % 2 != 0:
            print("No")
            exit(0)

    print("Yes")

Solution (Python):
w = input()
ww = set(w)
for s in ww:
    if w.count(s)&1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w=str(input())
from collections import Counter
cw=Counter(w)
for i in cw.values():
    if i%2!=0:
        print('No')
        exit()
print('Yes')

Solution (Python):
w=sorted(list(input()))
s="No"
for i in range(len(w)//2):
    if w[2*i]!=w[2*i+1]:
        break
    if i==len(w)//2-1:
        s="Yes"

print(s)

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

Solution (Python):
from collections import Counter

w = input()
lst = [x for x in Counter(w).values() if x % 2 == 1]
if not lst:
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter
s = list(input())
cs = Counter(s)
for i in cs.values():
  if i % 2 != 0:
    print("No")
    exit()
print("Yes")

Solution (Python):
s = list(input())
a = {}
for i in s:
  if i in a:
    a[i] += 1
  else:
    a[i] = 1
for j in a.values():
  if j%2 == 0:
    continue
  else:
    print('No')
    break
else:
  print('Yes')

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

Solution (Python):
w=input()

alpha="abcdefghijklmnopqrstuvwxyz"

for i in range(26):
    if w.count(alpha[i])%2!=0:
        print("No")
        exit()
print("Yes")

Solution (Python):
def takahashi():
    w = input()
    while True:
        if w.count(w[0]) % 2 != 0:
            print("No")
            return
        else:
            w = w.replace(w[0], "")
        if "" == w:
            print("Yes")
            return


takahashi()

Solution (Python):
import collections

w = input()

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

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

ans = False;

for i in b:
  if a.count(i) % 2 != 0:
    print('No')
    exit()
print('Yes')

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

Solution (Python):
w = input()
a = dict()
can = False
for i in w:
    a[i] = w.count(i)
for i in a.values():
    if i % 2 != 0:
        can = False
        break
else:
    can = True
if can == True:
    print("Yes")
else:
    print("No")

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

dic={}

for i in w:
    if i in dic:
        dic[i]+=1
    else:
        dic[i]=1

val=dic.values()
ans='Yes'
for i in val:
    if i %2 !=0:
        ans='No'
        break
print(ans)

Solution (Python):
import collections
c = collections.Counter(input())
for i in c.values():
  if i%2 == 1:
    print('No')
    quit()
print('Yes')

Solution (Python):
from collections import Counter

s = input()

c = Counter(list(s))

for word , cnt in c.most_common():
	if cnt % 2 !=0:
		print('No')
		exit()
print('Yes')

Solution (Python):
from collections import Counter
w=input()
d=Counter(list(w))
c=0
for k in d.keys():
    if d[k]%2==0:
        c+=1
if c==len(d):
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
import string
def main():
  w=input()
  s=string.ascii_lowercase
  for i in s:
    if w.count(i)%2==1:
      print("No")
      return
  print("Yes")
    
main()

Solution (Python):

w = input()
W = list(set(w))

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

print('Yes')

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

flag=0
for uniq in w_uniq:
  if w.count(uniq)%2==1:
    print('No')
    flag=1
    break
if flag==0:
  print('Yes')

Solution (Python):
w = input()

import collections as cl

a = cl.Counter(w)
b = True
for i in a.values():
  if i % 2 == 1:
    b = False
    
if b == True:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
import collections

w = input()

count = collections.Counter(w)

ans = "Yes"

for item in count.items():
  if item[1] % 2 != 0:
    ans = "No"
  
print(ans)

Solution (Python):
w=list(input())
ans="Yes"
while w:
  if w.count(w[0])%2==0:
    x=w[0]
    while x in w:
      w.remove(x)
  else:
    ans="No"
    break
print(ans)

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

W = list(w)
Z = list('abcdefghijklmnopqrstuvwxyz')

for i in range(len(Z)):
    if W.count(Z[i]) % 2 != 0:
        print('No')
        break
    else:
        if i ==25:
            print('Yes')

Solution (Python):
w = input()

hist = [0]*27
for ch in w:
  hist[ord(ch)-ord('a')] += 1

ans = True
for i in range(27):
  if hist[i]%2==1:
    ans = False
print('Yes' if ans else 'No')

Solution (Python):
s = input()
l = [0]*100

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

for i in l:
    if i%2 != 0:
        print("No")
        exit()
print("Yes")

Solution (Python):
s=input()
sdic={}
flag=False
for i in range(len(s)):
  if(s[i] in sdic):
    sdic[s[i]]+=1
  else:
    sdic[s[i]]=1
for i in sdic:
  if(sdic[i]%2==1):
    flag=True
    break
if(flag):
  print("No")
else:
  print("Yes")

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

Solution (Python):
w = input()
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"]
for i in range(26):
  if w.count(alpha[i])%2!=0:
    print("No")
    break
  elif i == 25 and w.count(alpha[i])%2==0:
    print('Yes')

Solution (Python):
from collections import Counter
w = list(input())
w_cnt = Counter(w)
for key in w_cnt.keys():
    if w_cnt[key] % 2 != 0:
        print('No')
        exit()
print('Yes')

Solution (Python):
import collections
for c in collections.Counter(input()).values():
    if c % 2 == 1:
        print('No')
        exit()
print('Yes')

Solution (Python):
import collections
w = input()
c = collections.Counter(w)
ans = 0
for i in range(len(c)):
    if c.most_common()[i][1] % 2 == 0:
        ans += 1

if ans == len(c):
    print("Yes")
else:
    print("No")

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

r = True
for si in s:
    c = w.count(si)
    
    if c % 2 == 1:
        r = False

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

Solution (Python):
w = input()

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

print('Yes')

Solution (Python):
w = input()
s = set()
for c in w:
  s.add(c)
ok = True
for c in s:
  n = w.count(c)
  if n%2 != 0:
    ok = False
    break
if ok:
  print("Yes")
else:
  print("No")

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

pw=0
flag=True
while(pw<len(w) and flag):
  nc=w.count(w[pw])
  flag=not(nc%2)
  pw+=nc
  
if flag:
  print('Yes')
else:
  print('No')

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

Solution (Python):
def B_BeautifulStrings():
    from collections import Counter
    w = Counter(list(input()))
    ans = "Yes"
    for x in w.values():
        if x % 2:
            ans = "No"
    print(ans)
    
if __name__ == "__main__":
    B_BeautifulStrings()

Solution (Python):
s = input()
def ma():
  for c in 'abcdefghijklmnopqrstuvwxyz':
    if s.count(c) % 2 != 0:
      return 'No'
  return 'Yes'
print(ma())

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

Solution (Python):
w = input()

for i in range(len(w)):
  check = 0
  for j in range(len(w)):
    if w[i] == w[j]:
      check += 1
  
  if (check % 2) != 0:
    break
    
if (check % 2) == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
from collections import Counter as ca

s = input()

count = ca(s)
count = list(count.values())
ans = 'Yes'
for i in count:
  if i % 2 != 0:
    ans = 'No'
    break
    
print(ans)

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

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

ans = "Yes"
for k in d.keys():
    if d[k] % 2:
        ans = "No"
        break

print(ans)

Solution (Python):
w=input()
w_set=set(w)
flag=True

for c in w_set:
  cnt=w.count(c)
  if cnt%2==1:
    flag=False
    break

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

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

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

Solution (Python):
from collections import Counter

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

isBeautiful()

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([S.count(i) % 2 == 0 for i in set(S)]) else "No")

Solution (Python):
from collections import Counter
s = list(input())
S = Counter(s)

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

Solution (Python):

import sys

li_c = list(input()) 
li_uniq = set(li_c)

for c in li_uniq:
    if li_c.count(c) % 2 != 0:
        print("No")
        sys.exit()

print("Yes")

Solution (Python):
s = input()
while len(s) > 0:
    if s.count(s[0]) % 2 != 0:
        print('No')
        exit()
    else:
        s = s.replace(s[0], '')
print('Yes')

Solution (Python):
a = input()
check = [0 for _ in range(26)]
for v in a:
    check[ord(v)-ord('a')]+=1
for i in range(26):
    if check[i]%2==1:
        print('No')
        exit()
print('Yes')

Solution (Python):
s = input()
n = len(s)
w = []
x = []
for i in range(n):
  w.append(s[i])
w.sort()
for i in range(n):
  if i % 2 == 0:
    x.append(w[i])
y = x * 2
y.sort()
if w == y:
  print('Yes')
else:
  print('No')

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

Solution (Python):
w=input()
alphabet=["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"]
flag=0
for i in alphabet:
	num=w.count(i)
	if num%2==1:
		flag=1
		break
if flag==0:
	print("Yes")
else:
	print("No")

Solution (Python):
w = sorted(list(input()))
isBeautiful = 'Yes'
stringMap = {}

for string in w:
    if string in stringMap:
        stringMap[string] += 1
    else:
        stringMap[string] = 1

for string in stringMap:
    if stringMap[string]%2 != 0:
        isBeautiful = 'No'
        break

print(isBeautiful)

Solution (Python):
w = input()
emerge = []
ans = 0 

for i in w:
  if i not in emerge:
    if w.count(i) % 2 == 0:
      pass
    else:
      ans = 1
if ans:
  print("No")
else:
  print("Yes")

Solution (Python):
W = str(input())
if W.count('a') % 2 == 0:
  if W.count('b') % 2 == 0:
    if W.count('c') % 2 == 0:
      if W.count('d') % 2 == 0:
        if W.count('e') % 2 == 0:
          if W.count('f') % 2 == 0:
            if W.count('g') % 2 == 0:
              if W.count('h') % 2 == 0:
                if W.count('i') % 2 == 0:
                  if W.count('j') % 2 == 0:
                    if W.count('k') % 2 == 0:
                      if W.count('l') % 2 == 0:
                        if W.count('m') % 2 == 0:
                          if W.count('n') % 2 == 0:
                            if W.count('o') % 2 == 0:
                              if W.count('p') % 2 == 0:
                                if W.count('q') % 2 == 0:
                                  if W.count('r') % 2 == 0:
                                    if W.count('s') % 2 == 0:
                                      if W.count('t') % 2 == 0:
                                        if W.count('u') % 2 == 0:
                                          if W.count('v') % 2 == 0:
                                            if W.count('w') % 2 == 0:
                                              if W.count('x') % 2 == 0:
                                                if W.count('y') % 2 == 0:
                                                  if W.count('z') % 2 == 0:
                                                    print('Yes')
                                                    exit()
print('No')

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

Solution (Python):
w = input()
w_list = 'abcdefghijklmnopqrstuvwxyz'
a = 0
for i in w_list:
    if w.count(i) % 2 == 0:
        a += 0
    else:
        a += 1
if a == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()
f=0
def beautiful(w):
    for i in w:
        if w.count(i)%2 != 0: 
            return "No"
    return "Yes"
print(beautiful(w))

Solution (Python):
from collections import Counter


s = input()
if all([i%2==0 for i in Counter(s).values()]):
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
def f(w):
    cnt_dict = {}

    for s in w:
        if s not in cnt_dict.keys():
            cnt_dict[s] = 0
        cnt_dict[s] += 1

    for v in cnt_dict.values():
        if v % 2 != 0:
            print("No")
            return
    print("Yes")


w = input()
f(w)

Solution (Python):
w = str(input())
for i in range(26):
  if w.count(chr(i + 97)) % 2 == 0:
    pass
  else:
    print("No")
    exit()
print("Yes")

Solution (Python):
import sys

w = input()

if len(w) % 2 == 1:
    print('No')
    sys.exit()

for i in range(len(w)):
    if w.count(w[i]) % 2 == 1:
        print('No')
        sys.exit()

print('Yes')

Solution (Python):
S = input()

checker = 0
for i in range(len(S)):
  if S.count(S[i]) % 2 == 1:
    checker = 1
    break

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

Solution (Python):
w = input()

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

print(ans)

Solution (Python):
w = input()
flag = True
for i in set(w):
    if w.count(i)%2 == 1:
        flag = False
        break

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

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

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

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

Solution (Python):
S = input()
c_dict = {}
for char in S:
  if char in c_dict:
    c_dict[char] += 1
  else:
    c_dict[char] = 1
for cnt in c_dict.values():
  if cnt%2 != 0:
    print('No')
    exit()
print('Yes')

Solution (Python):
w = input()
w_sep = [i for i in w]
w_unqs = set(w_sep)
num_odd = 0
for w_unq in w_unqs:
    num = w_sep.count(w_unq)
    if num % 2 == 0:
        continue
    else:
        num_odd += 1

if  num_odd > 0:
    print('No')
else:
    print('Yes')

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

Solution (Python):
w = input()

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

Solution (Python):
word = input()

flag = True
if len(word)%2 == 1:
    flag = False

wordset = set(word)
leng = len(wordset)
for s in wordset:
    if word.count(s)%2 == 1:
        flag = False
        break
if flag:print("Yes")
else: print("No")

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

print( "Yes" )

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

Solution (Python):
s = input()
for i in range(len(s)):
  if s.count(s[i]) % 2 == 0:
    pass
  else:
    print('No')
    break
  if i == len(s) - 1:
  	print('Yes')

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

Solution (Python):

import string
w = input()

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

Solution (Python):
def main():
  ans = func(input())
  print(ans)
  
  
def func(sentence):
  unique_list = set(sentence)
  for s in unique_list:
    if sentence.count(s) % 2 != 0:
      return('No')
      break
  return('Yes')

if __name__ == '__main__':
  main()

Solution (Python):
w=input()
w_list=list(w)
w_unique=list(set(w_list))
c=0
for x in w_unique:
    if w_list.count(x)%2==0:
        c=c
    else:
        c+=1
        
if c==0:
    print('Yes')
    
else:
    print("No")

Solution (Python):
import sys
w=input()
w_unique=list(set(w))


count={i:0 for i in w_unique}
if len(w)%2 != 0:
  print("No")
  sys.exit()

for i in w:
  count[i]+=1

  
for i in w_unique:
  if count[i]%2 != 0:
    print("No")
    sys.exit()
print("Yes")

Solution (Python):

import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

def solve(w: str):
    count = [0] * 26
    for c in w:
        count[ord(c) - ord('a')] += 1
    for cnt in count:
        if cnt % 2:
            print(NO)
            return
    print(YES)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    w = next(tokens)  
    solve(w)

if __name__ == '__main__':
    main()

Solution (Python):

import sys, math, fractions, itertools, collections

YES = "Yes"  
NO = "No"  

def solve(w: str):
    c = collections.Counter(w)
    d = c.values()
    flag = True
    for dd in d:
        if dd % 2 != 0:
            flag = False
    if flag:
        print('Yes')
    else:
        print('No')
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    w = next(tokens)  
    solve(w)

if __name__ == '__main__':
    main()

Solution (Python):

from  collections import Counter
import sys

def main():
    data = list(input())
    c_dic = Counter(data)
    for eord, count in c_dic.items():
        if count % 2 == 1:
            print('No')
            sys.exit()
    print('Yes')





if __name__ == '__main__':
    main()

Solution (Python):

w = input()
l = len(w)
sig = 0

for i in range(l):
    if w.count(w[i])%2 !=0:
        sig = 1
        break

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

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

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

Solution (Python):
w = list(input())
w_unique = list(set(w))
w_unique_count = []

for i in range(len(w_unique)):
    w_unique_count.append(w.count(w_unique[i]))

check = 0

for i in range(len(w_unique)):
    if w_unique_count[i] % 2 == 1:
        check = 1

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

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

Solution (Python):
s = str(input())
l = []
for char in s:
  l.append(char)
l.sort()
if len(l)%2 == 1:
  print('No')
else:
  flag = True
  for i in range(0,len(l),2):
    if l[i] != l[i+1]:
      flag = False
      break
  if flag:
    print('Yes')
  else:
    print('No')

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

print(ans)

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

Solution (Python):
from collections import Counter
w = input()
c = Counter(w)
f = 0

for i in c.values():
  if i%2!=0:
    f=1

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