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()
d = dict()
flag = 0
for i in w:
    if i in d:
        d[i]+=1
    else:
        d[i] = 1
for k,v in d.items():
    if v%2==0:
        flag=1
    else:
        flag=0
        break
if flag==1:
    print("Yes")
else:
    print("No")

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

Solution (Python):

w = list(input())

w_ = list(set(w))
flg = True
for a in w_:
    if w.count(a)%2 != 0:
        flg = False

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

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

Solution (Python):
w=input()
hm=lambda a,s:sum([a==x for x in s])

def isbeautiful(s):
    for a in s:
        if hm(a,s)%2==1:
            return 'No'
    return 'Yes'

print(isbeautiful(w))

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

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

Solution (Python):
import collections 

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

f = True
for val in c.values():
  if val%2==1:
    f = False
if f:
  print("Yes")
else:
  print("No")

Solution (Python):

from collections import defaultdict

w = input()
d = defaultdict(int)
for i in w:
    d[i] += 1
print("YNeos"[any(i % 2 > 0 for i in d.values())::2])

Solution (Python):
from collections import Counter
if sum(map(lambda x: x%2, Counter(input()).values())) == 0:
	print('Yes')
else:
  print('No')

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

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

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

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

w_set = set(w)
flag = 0

for l in w_set:
    if w.count(l)%2 != 0:
        print('No')
        flag = 1
        break

if flag==0:
    print('Yes')

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

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

keys = list(set(w))
cnt = 0
for k in keys:
    kl = len([x for x in w if x == k])
    if kl % 2 != 0:
        cnt += 1

print("Yes" if cnt == 0 else "No")

Solution (Python):
import collections
s = input()
c = collections.Counter(s)
c = list(c.values())

for i in range(len(c)):
  if c[i]%2==0:
    c[i]=True
  else:
    c[i]=False

if all(c):
  print('Yes')
else:
  print('No')

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

Solution (Python):
s = input()

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

Solution (Python):
w = list(input())
alphabet = list(chr(ord("a") + i) for i in range(26))
enumerate = [0]*26

for x in w:
    for i in range(26):
        if x == alphabet[i]:
            enumerate[i] += 1

ans = 0
for i in range(26):
    if enumerate[i]%2 != 0 and enumerate[i] > 0 :
        ans = 1

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

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

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

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

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

r = 'Yes'
for w in ss:
  if s.count(w) % 2 == 1:
    r = 'No'
    break
print(r)

Solution (Python):
w = input()

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

ans = "Yes"
for c in cnt_dict.keys():
    if cnt_dict[c] % 2 == 1:
        ans = "No"
        break
print(ans)

Solution (Python):
import sys
st = str(input())

st = sorted(st)

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

Solution (Python):
w = input()
wl = list(w)
wu = list(set(wl))
wu_len  = len(wu)
counter = 0
for wo in wu:
  if wl.count(wo) % 2 == 0:
    counter+=1
  else:
    break
if counter == int(wu_len):
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
l = []
for i in range(len(s)):
	l.append(s.count(s[i]))
r = []
for x in l:
	if(x%2!=0):
		r.append(False)
	else:
		r.append(True)

if(all(r)):
	print("Yes")
else:
	print("No")

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

Solution (Python):
w = input()
a = set(w)
flg  = 1
for i in a:
    if (w.count(i)%2 != 0) :
        flg = 0
        break

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

Solution (Python):
s = input()
n = [0] * 26
for i in s:
    n[ord(i) - 97] += 1

if 1 in [x % 2 for x in n]:
    print('No')
else:
    print("Yes")

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

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

print('Yes')

Solution (Python):
import collections

w = list(input())
w_count = collections.Counter(w)
flag = True
for i in w_count.values():
    if i % 2 != 0:
        flag = False
if flag:
    print("Yes")
else:
    print("No")

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

cc = collections.Counter(w)

cond = True
for c in cc:
    cond &= cc[c] % 2 == 0


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

Solution (Python):
w=input()
dp=[0]*200
for i in range(len(w)):
  dp[ord(w[i])]+=1
for i in range(200):
  if dp[i]%2!=0:
    print('No')
    exit()
print('Yes')

Solution (Python):
D={}
W=input()

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

F=True
for a in D:
    F&=(D[a]%2==0)

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

Solution (Python):
def groupby(a):
    a2=[[a[0],1]]
    for i in range(1,len(a)):
        if a2[-1][0]==a[i]:
            a2[-1][1]+=1
        else:
            a2.append([a[i],1])
    return a2
w=list(input())
w.sort()
w=groupby(w)
for i in w:
    if i[1]%2==1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w=input()
alphabet=[chr(ord('a')+i) for i in range(25)]
count=1
for i in range(25):
  count=count*(1-(w.count(alphabet[i])%2))
if count%2==1:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
w=input()
lst=[]
flag = 0
for i in w:
    lst.append(i)

for i in range(len(w)):
    if lst[i] == 99:
        continue
    c = 1
    j = i + 1
    while j < len(w):
        if lst[i] == lst[j]:
            lst[j] = 99
            c += 1
        j += 1
    if c % 2 != 0:
        print("No")
        flag = 1
        break

if flag == 0:
    print("Yes")

Solution (Python):
w = input()
datalist = [x for x in w]
dataset = set(datalist)
list_set = list(dataset)
count = 0
answers = []
for i in list_set:
    count = datalist.count(i)
    if count % 2 == 0:
        answers.append("Yes")
    else:
        answers.append("NO")


if "NO" in answers:
    print("No")
else:
    print("Yes")

Solution (Python):
from collections import Counter

l=[x for x in input()];n=len(set(l));
c=Counter(l)
ans=[x for x in c.values() if x%2!=0]
print ("No" if len(ans)>0 else "Yes")

Solution (Python):









import sys
input = sys.stdin.readline

S = input()
Sset = set(S.rstrip('\n'))


n = 0
for SS in Sset:
    if S.count(SS) % 2 == 0:
        n += 1
if len(Sset) == n:
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter

w = list(input())
c = Counter(w)
for v in c.values():
    if v % 2 != 0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
s = input()
acsii = [chr(i) for i in range(97, 97+26)]
flag = True
for i in acsii:
    if s.count(i) % 2 != 0:
        flag = False
        break

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

Solution (Python):
n = [0 for _ in range(26)]
S = list(input())
ans = "Yes"
for i in S:
    n[ord(i) - ord('a')] += 1
for i in n:
    if i % 2 != 0:
        ans = "No"
print(ans)

Solution (Python):
w=input()
d={}
for i in range(int(len(w))):
    if w[i] not in d:
        d[w[i]]=1
    else:
        d[w[i]]+=1
for i in d.values():
    if i%2==1:
        print("No")
        exit()
print("Yes")

Solution (Python):
import collections

w = input()
C = collections.Counter(w).values()

for c in C:
  if c%2==0:
    pass
  else:
    print("No")
    exit()
    
print("Yes")

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

else:
    print('No')

Solution (Python):
a = list(input())
even_number = [x for x in range(0,101,2)]
tmp_list = []
tmp_set = set(a)

tmp_list = [a.count(x) for x in tmp_set]
if all(x % 2 == 0 for x in tmp_list) == True:
    print("Yes")
else:
    print("No")

Solution (Python):
w=input()

dict={}
alh="abcdefghijklmnopqrstuvwxyz"
for i in alh:
  dict[i]=0
for i in w:
  dict[i]+=1
flag=True
for i in alh:
  if dict[i]%2==1:
    flag=False
if flag:
  print("Yes")
else:
  print("No")

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

Solution (Python):


w = list(str(input()))
w_s = set(w)

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

print('Yes')

Solution (Python):
w = input()

cher_count = {}

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

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

Solution (Python):
flag=True
a=list(input())
a=sorted(a)
while len(a)>0 and flag:
    n=a.count(a[0])
    if n%2==0:
        a=a[n:]
    else:
        flag=False
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
import collections
w=list(input())
alpha=[chr(i) for i in range(97, 97+26)]
beautiful=True
C=collections.Counter(w)
for i in alpha:
    if C[i]%2==1:
        beautiful=False
if beautiful:
    print("Yes")
else:
    print("No")

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

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


for i in range(97, 123):
    
    if w.count(chr(i)) % 2 != 0:
        print("No")
        exit()

print("Yes")

Solution (Python):
S = input()
count = dict()
for c in S:
    if c in count:
        count[c] += 1
    else:
        count[c] = 1

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

Solution (Python):

n=input()
a=[]
for i in range(len(n)):
     a.append(n[i])
sum_=0
for i2 in range(len(a)):
    sum_=sum_+a.count(a[i2])%2

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

Solution (Python):
w = list(input())
ch = []

for i in w:
    if i not in ch:
        ch.append(i)

ans = 0
for j in ch:
    if w.count(j) % 2 != 0:
        ans += 1
        break

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

Solution (Python):
import sys
input = sys.stdin.readline
from collections import Counter


def read():
    w = input().strip()
    return w,


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


if __name__ == '__main__':
    inputs = read()
    print(solve(*inputs))

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

for i in x:
    if w.count(i) % 2 == 0:
        pass
    else:
        print('No')
        exit()
print('Yes')

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

Solution (Python):
from collections import *
C = Counter(input())
a = "Yes"

for v in C.values():
  if v%2==1:
    a = "No"

print(a)

Solution (Python):
w = input()
res = []
for i in w:
  if i not in res:
    res.append(i)

ans = 0
for j in res:
  if w.count(j) % 2 == 0:
    ans += 1
if ans == len(res):
  print('Yes')
else:
  print('No')

Solution (Python):
import collections

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

for v in c.values():
    if v & 1:
        print("No")
        break
else:
    print('Yes')

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

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

mylist=Counter(w)
for a in mylist.values():
  if a%2==0:
    continue
  else:
    print('No')
    exit()
print('Yes')

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

Solution (Python):
from collections import Counter

W = str(input())
ans = "Yes"
CW = Counter(W)
for k,v in CW.items():
  if v%2 != 0:
    ans = "No"
    break

print(ans)

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

elements = set(w)
 
check = 0
 
for e in elements:
    if w.count(e) % 2 != 0:
        check = 1
 
if check == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
a = [0]*26
s = str(input())
for i in range(0, len(s)):
    p = ord(s[i]) - 97
    a[p] += 1
ans = "Yes"
for i in range(0, 26):
    if a[i]%2==1:
        ans = ans.replace(ans, "No")
print(ans)

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

elements = set(w)

check = 0

for e in elements:
    if w.count(e) % 2 != 0:
        check = 1

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

Solution (Python):
from collections import Counter

w = input()

c = Counter(w)
values, counters = zip(*c.most_common())

for counter in counters:
    if counter % 2 != 0:
        print('No')
        exit()
print('Yes')

Solution (Python):
from collections import Counter


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    s = input().strip()
    G = Counter()
    for c in s:
        if c.islower():
            G[c] += 1
    return 'Yes' if all(val%2 == 0 for val in G.values()) else 'No'


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

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

w = l()

cnt = 0
w.sort()
if len(w) == 1:
	print("No")
else:
	for i in range(len(w) - 1 ):
		if w[i] == w[i+1]:
			cnt += 1
			if  cnt%2 == 0 and i == len(w) - 2:
				print("No")
				exit()
		elif w[i] != w[i+1]:
			if cnt%2 == 0:
				print("No")
				exit()
			cnt = 0
	print("Yes")

Solution (Python):
s = list(input())
n = len(s)
c = 0
ans = "Yes"

for i in range(n):
  for j in range(n):
    if s[i] == s[j]:
      c += 1
  if c%2 != 0:
    ans = "No"
    break
  c = 0

print(ans)

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

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

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

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

print('Yes')

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

d = {}
for i in w:
  if i not in d: d[i] = 1
  else: d[i] += 1
print("Yes" if all(i%2 == 0 for i in d.values()) else "No")

Solution (Python):
s = input()
k={}
ok=True
for i in s:
    if i not in k: k[i]=1
    else: k[i]+=1
for i in k.values():
    if i%2!=0:
        ok=False
        break
if ok: print("Yes")
else: print("No")

Solution (Python):
W = input()
ji={}

for i in W:
    if i not in ji:
        ji[i]=1
    else:
        ji[i]+=1

for j in ji.values():
    if j % 2 ==0:
        result="Yes"
    else:
        result="No"
        break
print(result)

Solution (Python):
l=input()

import string

a=string.ascii_lowercase

for i in range(len(a)):
  c=l.count(a[i])
  if c % 2==0:
    pass
  else: 
    print('No')
    exit()
    
print('Yes')

Solution (Python):
w = input()
lis = list(w)
dic = {i:0 for i in lis}

for i in lis:
    dic[i] += 1

for d in dic.values():
    if d % 2 != 0:
        print("No")
        exit()

print("Yes")

Solution (Python):
from collections import OrderedDict

w = input()
count = 0

w2 = list(set(w))



num = []
for i in range(len(w2)):
    num.append(w.count(w2[i]))

for i in range(len(w2)):
    if num[i] % 2 == 0:
        count += 1

if(count == len(w2)):
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter
import sys

w = list(input())

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

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

Solution (Python):
import sys
w=str(input())
w_unq=set(w)

for i in w_unq:
    cnt=w.count(i)
    if not cnt%2==0:
        print('No')
        sys.exit()

print('Yes')

Solution (Python):
w=input()
l=len(w)

dic={}

for i in range(l):
    if w[i] not in dic:
        dic[w[i]]=1
    else:
        dic[w[i]]+=1

flag=1
for val in dic.values():
    if val%2==1:
        flag=0

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

Solution (Python):
'''     
        
        
        

import sys
import math


def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())

def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end=" \ ")

MODPRIME = int(1e9+7); BABYMODPR = 998244353;

ONLINE_JUDGE = 1
if not ONLINE_JUDGE:
    sys.stdin  = open("input.txt","r")
    sys.stdout = open("output.txt","w")
    sys.stderr = open("output.txt","w")


import functools as fnc
print("Yes") if not fnc.reduce(lambda a, b: a^b, list(map(lambda x: ord(x) - ord('a') + 1, input()))) else print("No")


'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
DO NOT PLAGIARISE.
TESTCASES:
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

Solution (Python):
'''     
        
        
        

import sys
import math


def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())

def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end=" \ ")

MODPRIME = int(1e9+7); BABYMODPR = 998244353;

ONLINE_JUDGE = 1
if not ONLINE_JUDGE:
    sys.stdin  = open("input.txt","r")
    sys.stdout = open("output.txt","w")
    sys.stderr = open("output.txt","w")


s = input()
d = {}; flag = True
from collections import Counter as C
d = C(s)
for _, v in d.items():
    if v % 2:
        flag = False
        break
if flag:
    print("Yes")
else:
    print("No")

'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
DO NOT PLAGIARISE.
TESTCASES:
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

Solution (Python):
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	w = list(S())
	c = Counter(w)
	c_array = np.array(list(c.values()))
	if np.all(c_array % 2 == 0):
		print('Yes')
	else:
		print('No')

if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter
W = input()
C = Counter(W)
for v in C.values():
    if v % 2 == 1:
        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()
for i in range(0,len(w)):
  if w.count(w[i])%2==1:
    print("No")
    exit()
print("Yes")

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

a_n = ord("a")
alf_dict = {}

for i in range(26):
    alf_dict[chr(a_n)] = 0
    a_n += 1

for x in w:
    alf_dict[x] += 1

flag = 0
for k, v in alf_dict.items():
    if v % 2 == 1:
        flag = 1
        break

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

Solution (Python):
import collections
str=input().strip()
ans=True

for item, count in collections.Counter(str).items():
   if count%2!=0:
       ans=False
       
if ans==False:
    print("No")
else:
    print("Yes")

Solution (Python):


import sys
from copy import deepcopy
input=sys.stdin.readline

def main():
    ab="abcdefghijklmnopqrstuvwxyz"
    w=input()
    b=1
    for a in ab:
        c=w.count(a)
        if c%2!=0:
            b=0
            break
    if b==1:
        print("Yes")
    else:
        print("No")
    
if __name__=="__main__":
    main()

Solution (Python):
import collections
w=input()
W=[]
for i in w:
    W.append(i)
c=collections.Counter(W)
l=c.values()
for num in l:
    if num%2!=0:
        print('No')
        exit()
print('Yes')

Solution (Python):






from collections import Counter
w = input()
mycounter = Counter(w).values()





for x in mycounter:
    if x%2 != 0:
        print("No")
        break
else:
    print("Yes")

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

Solution (Python):
def resolve():
    w = str(input())
    ls = set(w)
    for l in ls:
        if w.count(l) % 2 == 1:
            print('No')
            return

    print('Yes')
    return

resolve()

Solution (Python):
def main():
    w = input()
    A = [0]*26
    for char in w:
        A[ord(char) - ord('a')] += 1
    for a in A:
        if a%2 != 0:
            print("No")
            return
    print("Yes")
    return

main()

Solution (Python):
from collections import Counter
w = list(input())
cnt = Counter(w)
for v in cnt.values():
    if v % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
import collections
w = list(input())
c = collections.Counter(w)
ans = 'Yes'
for s in c.values():
    if s % 2 != 0:
        ans = 'No'
print(ans)

Solution (Python):
w = input()

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

Solution (Python):
import collections as cl
import sys

w = list(input())
c = cl.Counter(w)

ans_1 = c.values()

for i in ans_1:
    if int(i) % 2 == 0:
        pass
    else:
        print("No")
        sys.exit()

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):
w=input()
check=list(set(w))
flag=True
for i in range(0,len(check)):
  if w.count(check[i])%2!=0:
    flag=False
    break
if flag:
  print("Yes")
else:
  print("No")

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

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

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

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

Solution (Python):

w = list(input())
from collections import Counter
c = Counter(w)
flg = True

for i in c.values():
    if i % 2 != 0:
        flg = False
        break
        
if flg:
    print('Yes')
else:
    print('No')

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

from collections import Counter

bea = Counter(w).values()

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

print("Yes")

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

Solution (Python):
from collections import Counter
w = input()
c = Counter(w)
cnt = 0
for i in c.values():
    if i % 2 == 0:
        cnt += 1
print('Yes' if cnt == len(c) else 'No')

Solution (Python):
from collections import Counter

C = Counter(list(input()))

L = [i%2 for i in C.values()]

if sum(L) == 0:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
w=input()
s='abcdefghijklmnopqrstuvwxyz'
c=0
if len(w)%2==1:
    print('No')
else:
    for i in range(len(s)):
        if w.count(s[i])%2==1:
            c+=1
    if c>0:
        print('No')
    else:
        print('Yes')

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

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

if w.count(i)%2 == 0:
    print('Yes')

Solution (Python):
alp=list("qwertyuiopasdfghjklzxcvbnm")
s=list(input())
out=[0]*len(alp)

for c in s:
  out[alp.index(c)]+=1
res="Yes"
for x in out:
  if x%2==1:
    res="No"
    break
    
print(res)

Solution (Python):
import math
from collections import deque
from collections import defaultdict


def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): 
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): 
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} 
def bitArr(n):
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): 
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	
	ans = data[:]
	return ans

w = readChar()

d = defaultdict(int)

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

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

print("Yes")

Solution (Python):
s=input()
s=sorted(s)
t=s[::2]
if len(s)%2==0 and s==sorted(t*2):
  print('Yes')
else:
  print('No')

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

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

Solution (Python):


















import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
w = input()
for i in range(26):
    c = chr(ord('a')+i)
    if w.count(c)%2:
        print('No')
        exit()
print('Yes')

Solution (Python):
s = input()

from collections import Counter

c = Counter(s)

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

print("Yes")