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()
l=dict()
for c in w:
    if c in l:
        l[c] += 1
    else:
        l[c] = 1

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

print(("No","Yes")[flag])

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

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

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

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

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

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

S = list(input().strip())
m = {}

for v in S:
    if m.get(v) != None:
        m[v] += 1
    else:
        m[v] = 1
        
for v in m.values():
    if v % 2 != 0:
        print("No")
        exit()
        
print("Yes")

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

Solution (Python):
w = input()
alphabet_list = [chr(i) for i in range(97,97+26)]

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

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

for count_s in s:
    if (int(s.count(count_s)%2) != 0) :
        print("No")
        sys.exit()

print("Yes")

Solution (Python):
from collections import Counter

w = input()
c = Counter(list(w))
isBeautiful = True
for i in c.values():
    if i % 2:
        isBeautiful = False
        break
if isBeautiful:
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter

w = input()
c = Counter(list(w))
isBeautiful = True
for i in c.values():
    if i % 2:
        isBeautiful = False
        break
if isBeautiful:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'
cntArr = [0]*24
isBeautiful = True
for i in range(24):
    if(w.count(alphabet[i]) %2 == 1):
        isBeautiful = False
        break
if(isBeautiful):
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter
s=list(str(input()))
c=Counter(s)
l=list(c.values())
flag=False
for i in range(len(l)):
    if l[i]%2!=0:
        flag=True
print("YNeos"[flag::2])

Solution (Python):
from collections import Counter

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

Solution (Python):
from collections import defaultdict

d = defaultdict(lambda: 0)
s = input().strip()
for c in s:
    d[c] += 1

ans = True
for _, v in d.items():
    if v % 2 != 0:
        ans = False
        break

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

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

Solution (Python):
from collections import Counter

s = input()
c = Counter(s)

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

Solution (Python):
from collections import Counter

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

Solution (Python):
import collections
w = [c for c in input()]

c = collections.Counter(w)

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

print('Yes')

Solution (Python):
w = str(input())
s = {}
 
for wrd in w:
  if s.get(wrd) is None:
    s[wrd] = 1
  else:
    s[wrd] += 1
 
ans = 1
for wrd in s:
  if s[wrd] %2 !=0:
    ans = 0
    break
if ans:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys

w = input()
d ={}

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

for n in d.values():
    if n % 2 != 0:
        print('No')
        sys.exit()
        
print('Yes')

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

Solution (Python):
w = sorted(input())
ret = 'Yes'
if len(w) % 2 == 0:
    for i in range(0, len(w)-1, 2):
        if w[i] != w[i+1]:
            ret = 'No'
            break
else:
    ret = 'No'
print(ret)

Solution (Python):
a = str(input())
s = len(a)
while s % 2 == 0:
    x = a[0:1]
    a = a.replace(x,"")
    s = len(a)
    if s == 0:
        print("Yes")
        exit()
print("No")

Solution (Python):
a = list(input())
a = sorted(a)
def count(a):
    b =[]
    for i in range(0,len(a)-2):
        if a[i] != a[i+1]:
            b.append( i+1)
    return b

b = count(a)
b.append(len(a))

for i in reversed(range(0,len(b)-1)):
    b[i+1] =b[i+1] - b[i]

d = 0
for i in range(0,len(b)):
    d = d +b[i]%2

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

Solution (Python):
w=sorted(input())
s={}
for i in w:
    s[i]=s.get(i,0)+1
ans='Yes'
for v in s.values():
    if v%2!=0:ans='No'
print(ans)

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

Solution (Python):
n={c:0 for c in "abcdefghijklmnopqrstuvwxyz"}
for s in input():
    n[s] = 1 - n[s]
print("YNeos"[sum(n.values())>0::2])

Solution (Python):
w = [c for c in str(input())]

def f(w):
    set_w = list(set(w))
    for n in set_w:
        if w.count(n) % 2 == 1:
            return 'No'
            break
    return 'Yes'
print(f(w))

Solution (Python):
w=list(input())
W=list(set(w))
m=0
for i in range(len(W)):
    if w.count(W[i])%2==0:
        m+=1

if m==len(W):
    print('Yes')
else:
    print('No')

Solution (Python):

w = input()
ww = sorted(w)
flag = True
if len(w) % 2 != 0:
    flag = False
else:
    ww = sorted(w)
    for i in range(0, len(ww), 2):
        if ww[i] != ww[i+1]:
            flag = False
        
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):

w = input()
a = w.count("a") % 2
b = w.count("b") % 2
c = w.count("c") % 2
d = w.count("d") % 2
e = w.count("e") % 2
f = w.count("f") % 2
g = w.count("g") % 2
h = w.count("h") % 2
i = w.count("i") % 2
j = w.count("j") % 2
k = w.count("k") % 2
l= w.count("l") % 2
m = w.count("m") % 2
n = w.count("n") % 2
o = w.count("o") % 2
p = w.count("p") % 2
q = w.count("q") % 2
r = w.count("r") % 2
s = w.count("s") % 2
t = w.count("t") % 2
u = w.count("u") % 2
v = w.count("v") % 2
W = w.count("w") % 2
x = w.count("x") % 2
y= w.count("y") % 2
z = w.count("z") % 2

if(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)== 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

w = input()
if len(w)%2!=0:
    print("No")
    sys.exit()

ww = sorted(w)
flag = True
for i in range(0,len(ww),2):
    if ww[i]!=ww[i+1]:
        flag = False
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input().rstrip()
dct = {}

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

values = list(dct.values())
result = 'Yes'

for i in values:
    if i % 2 != 0:
        result = 'No'
        break

print(result)

Solution (Python):
w = input()
li = [0]*26
flag = True
for i in w:
    li[ord(i)-97]+=1
for i in li:
    if(i%2!=0):
        flag = False
if(flag):
    print('Yes')
else:
    print('No')

Solution (Python):

s=input()
flag=0
for i in list("abcdefghijklmnopqrstuvwxyz"):
  if s.count(i)%2!=0:
    flag=1
if flag == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
import collections

d = collections.Counter(input())

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

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

Solution (Python):
w = input()
flag_yes = True
for alph in w:
  if w.count(alph)%2 == 1:
    flag_yes = False
    break
if flag_yes == True:
  print("Yes")
else:
  print("No")

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

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

s = input().strip()

arr = [(s.count(num)%2==0) for num in s]

print("Yes" if all(arr) else "No")

Solution (Python):

alphabets = "abcdefghijklmnopqrstuvwxyz"
judge_flag = "Yes"

words = input().rstrip()

for i in alphabets:
    if (words.count(i))%2 == 0:
        pass
    else:
        judge_flag = "No"

print(judge_flag)

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

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

Solution (Python):
from collections import Counter

S = list(input())
print("No" if sum(map(lambda x:x%2,Counter(S).values())) else "Yes")

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

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

Solution (Python):
w=input()
print("YNeos"[any(map(lambda c:w.count(c)%2, set(w)))::2])

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

Solution (Python):
s=input();print('YNeos'[sum(s.count(c)%2for c in set(s))>0::2])

Solution (Python):
from collections import Counter
w = input()
if len([s for s, n in Counter(w).items() if n % 2 != 0]) == 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()
    else:
        w.replace(w[i],'')
print('Yes')

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

for c in w:
    if c in d.keys():
        d[c] += 1
    else:
        d[c] = 1

if all([x % 2== 0 for x in d.values()]):
    print('Yes')
else:
    print('No')

Solution (Python):

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

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

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

Solution (Python):
w=str(input())
x=["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"]
z=[]
for i in range(len(x)):
    if w.count(x[i])%2!=0:
        z.append(11)
    else:
        z.append(3)

if 11 in z:
    print("No")
else:
    print("Yes")

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

Solution (Python):
x = input()
s = set(list(x))
f = 0
for i in s:
  if x.count(i) % 2 == 1:
    f = 1
    break
  
if f == 1:
  print("No")
else:
  print("Yes")

Solution (Python):
from collections import defaultdict
def main():
	b = defaultdict(int)
	w = input()
	for c in w:
		b[c] += 1

	beauty = True
	for num in b.values():
		if num%2 == 1:
			beauty = False
			break
	if beauty:
		print("Yes")
	else:
		print("No")


if __name__ == '__main__':
	main()

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

Solution (Python):


def solve(w):
  for c in list(set(w)):
    if w.count(c)%2 != 0:
      return False
  return True


if __name__ == "__main__":
  if solve(str(input())):
    print('Yes')
  else:
    print('No')

Solution (Python):
import sys
from collections import Counter

w = input()
w_cnt = Counter(w)

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

print('Yes')

Solution (Python):
w = str(input())
w_list = list(w)
w_unique = list(set(w_list))

for char in w_unique:
    if w.count(char) % 2 != 0:
        print("No")
        break
else:
    print("Yes")

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

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

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

Solution (Python):
s = input()
target = set(s)
flg=True

for i in target:
    if s.count(i) % 2 != 0:
        print("No")
        flg=False
        break
if flg: 
    print("Yes")

Solution (Python):
W = input()

r = {}
for w in W:
    r.setdefault(w, 0)
    r[w] += 1

print("Yes" if len(list(filter(lambda x: x % 2 == 1, r.values()))) == 0 else "No")

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

Solution (Python):
w = input()

num = {}
for i in w:
    if i not in num:
        num[i] = 0
    num[i] += 1

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

print(ans)

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

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

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

Solution (Python):
from collections import defaultdict

def read_input():
    s = input().strip()
    return s


def submit():
    s = read_input()

    char_dic = defaultdict(int)
    for c in s:
        char_dic[c] += 1

    for item in char_dic.items():
        if item[1] % 2 == 1:
            print('No')
            return

    print('Yes')

if __name__ == '__main__':
    submit()

Solution (Python):
from collections import Counter

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

Solution (Python):
ws = input()

hash_map = {}

for w in ws:
    if w in hash_map.keys():
        hash_map[w] += 1
    else:
        hash_map[w] = 1

is_beatiful = True
for k in hash_map.keys():
    if hash_map[k] % 2 != 0:
        is_beatiful = False

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

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

Solution (Python):
w = input()
flag = False
arr = []
for i in w:
  arr.append(i)
  
set_arr = list(set(arr))
for i in set_arr:
  count_num = arr.count(i)
  if count_num % 2 != 0:
    flag = True
    break
if flag:
  print("No")
else:
  print("Yes")

Solution (Python):



def solve(w):
    flag = True
    W = list(w)
    W_set = set(W)
    
    for i in range(len(W_set)):
        index = W.count(list(W_set)[i])
        if(index%2 == 1):
            flag = False
            break
            
    if(flag):
        print("Yes")
    else:
        print("No")
    
if __name__ == '__main__':
    w = input()
    
    solve(w)

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

for c in w:
    if c in d.keys():
        d[c] += 1
    else:
        d[c] = 1

ans = "Yes"

for c in w:
    if d[c] % 2 == 1:
        ans = "No"
        
print(ans)

Solution (Python):
w=input()
wlist=[]

for i in range(len(w)):
    if w[i] in wlist:
        wlist.remove(w[i])
    else:
        wlist.append(w[i])

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

Solution (Python):
import sys
from collections import Counter

def main():
    input = sys.stdin.readline
    S = str(input().strip())
    c = Counter(S)
    
    for key in c:
        if c[key] % 2 == 1:
            return 'No'

    return 'Yes'


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

Solution (Python):
from collections import Counter

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

for i in h:
    if w.count(i)%2!=0:
        print("No")
        exit()

print("Yes")

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

Solution (Python):
W = input()
words = {}
odd = False

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

for word in words:
    if words[word] % 2 == 1:
        odd = True
        
if odd:
    print('No')
else:
    print('Yes')

Solution (Python):
from sys import stdin
input=stdin.readline().rstrip()
input_list=list(input)

output="Yes"
for i in range(len(input_list)):
  x=input_list[i]
  if input_list.count(x)%2==1:
    output="No"
    break
print(output)

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

Solution (Python):
mojiretsu = input()
lett = list(mojiretsu)
numlist = []
for i in lett:
    num = lett.count(i)
    numlist += [num]
jud = []
for i in numlist:
    if i%2 == 0:
        jud += ['Yes']
    else:
        jud += ['No']

anslist = [x for x in set(jud) if jud.count(x) > 1]
anslisT = [x for x in jud if jud.count(x) == 1]

if anslist == ['Yes']:
    print('Yes')
elif anslisT == ['Yes']:
    print('Yes')
else:
    print('No')

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

Solution (Python):

s = input()
w = list(set(s))
b = "Yes"
for i in w:
    if s.count(i)%2!=0:
        b = "No"
print(b)

Solution (Python):

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']


w=input()

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

print('Yes')

Solution (Python):
counts = [1] * 26
s = input()
for c in s:
    counts[ord(c) - ord("a")] += 1
tmp = 1
for c in counts:
    tmp *= c
print("Yes" if tmp % 2 == 1 else "No")

Solution (Python):
w=list(input())
if len(w)%2==1:print("No")
else:
    while w[0] in w[1:]:
        t=w[0]
        w.remove(t)
        w.remove(t)
        if w==[]:break
    print(["No","Yes"][w==[]])

Solution (Python):
w = input()

import collections

c = collections.Counter(w)

b = True
for i in c.values():
  if i % 2 == 1:
    b = False

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

Solution (Python):
s=input()
alpha=list('abcdefghijklmnopqrstuvwxyz')
ans=[0]*26
for i in range(len(s)):
  for j in range(26):
    if s[i]==alpha[j]:
      ans[j]+=1
for i in range(26):
  if ans[i]%2==1:
    print('No')
    break
  if i==25:
    print('Yes')

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

Solution (Python):
s=input()
alphabet="abcdefghijklmnopqrstuvwxyz"
list=[s.count(x) for x in alphabet]
for i in range(len(list)):
  if list[i]%2==0:
    list[i]=0
  else:
    list[i]=1
print("Yes" if sum(list)==0 else "No")

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

Solution (Python):
import collections

s = []
a = 0
x = input()
if len(x) % 2 != 0:
    print('No')
else:
    for i in x:
        s.append(i)
    c = collections.Counter(s)
    values, counts = zip(*c.most_common())
    for j in counts:
        if j % 2 == 0:
            a += 1
    if len(counts) == a:
        print('Yes')
    else:
        print('No')

Solution (Python):
w=list(input())
w_dct={}
for i in w:
    if i in w_dct.keys():
        w_dct[i]+=1
    else:
        w_dct[i]=1
        
tag=True
for i, j in w_dct.items():
    if j%2 ==0:
        pass
    else:
        tag=False
        
if tag:
    print('Yes')
else:
    print('No')

Solution (Python):


w = str(input())
h = set(w)

for i in h:
    if w.count(i)%2 != 0:
        print("No")
        exit()


print("Yes")

Solution (Python):

w = input()

while w != "":
    if w.count(w[0]) % 2 == 0:
        w = w.replace(w[0], '')
    else:
        print("No")
        exit()
print("Yes")

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

for i in range(len(count)):
    if (int(count[i][1]) % 2 != 0):
        print("No")
        exit()
print("Yes")

Solution (Python):
import collections
letter=collections.Counter(input())
counter=0
for v in letter.values():
    if v%2==1:
        counter +=1
        break
print("Yes") if counter==0 else print("No")

Solution (Python):
import re

pattern = '[a-z]+$'
w = input()
result = re.match(pattern, w)
if result:
    w_set = set(list(w))
    for word in w_set:
        counter = w.count(word)
        if counter % 2 == 1:
            print('No')
            break
    else:
        print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter
w = input()
num = Counter(w)
ans = list(num.values())
if not any([i%2 for i in ans]):
    print('Yes')
else:
    print('No')

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

Solution (Python):
def beautiful_strings(w: str) -> bool:
    freq = {}
    for c in w:
        freq.setdefault(c, 0)
        freq[c] += 1
    return all(f % 2 == 0 for f in freq.values())


if __name__ == "__main__":
    w = input()
    yes = beautiful_strings(w)
    print('Yes' if yes else 'No')

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

Solution (Python):
w = input()
dct_str = dict.fromkeys(w, 0)
 
for alp in w:
    dct_str[alp] += 1
flag = True
for alp in dct_str.keys():
    if dct_str[alp] % 2 != 0:
        flag = False
 
if flag == True:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()

d = {}
for x in w:
    d[x] = d.get(x, 0) + 1

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

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

Solution (Python):
w=input()
def solve():
  for j in [chr(i) for i in range(91,91+26)]:
    if w.count(j)%2!=0:
      print("No")
      return
  print("Yes")
  return

solve()

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

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

Solution (Python):
s = input()

s_list = list(s)
s_set = set(s_list)
flag = 0
for n in s_set:
  if s.count(n) % 2 != 0:
    flag = 1
    
if flag == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
from sys import stdin
input = stdin.readline
w = input().rstrip()
dic = {}
for i in w:
	if not i in dic:
		dic[i] = 1
	else:
		dic[i] += 1
for word in dic:
	if dic[word]%2 != 0:
		print("No")
		break
else:
	print("Yes")

Solution (Python):
def main():
    w = input()
    judge = ""
    for i in w:
        if w.count(i) %2 == 0:
            judge = "Yes"
        elif w.count(i) %2 != 0:
            judge = "No"
            break
    print(judge)
main()

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

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

main2()

Solution (Python):
import collections
s = input()
m = collections.Counter(s)
 
if len(list(filter(lambda x:x%2 == 1,m.values())))  > 0:
 	print("No")
else:
 	print("Yes")

Solution (Python):
a = input()
a = [str(x) for x in a]

import collections
b = collections.Counter(a)
N = len(b)
c = 0

for i in b.values():
    if i % 2 == 0:
        c += 1 
    else:
        pass
      
print('Yes' if c == N else "No")

Solution (Python):
from functools import reduce

def main():
    
    
    
    
    

    
    
    s = list(input().rstrip())
    dict = {}
    b_flag = True
    for char in s:
        if(char in dict.keys()):
            dict[char] = dict[char] + 1
        else:
            dict[char] = 1
        
    for v in dict.values():
        if v % 2 == 1:
            b_flag = False
    if b_flag:
        print('Yes')
    else:
        print('No')
        
if __name__ == '__main__':
    main()

Solution (Python):
str = input()
dict = {}
isBeautiful = True

for i in range(len(str)):
  if str[i] in dict:
    dict[str[i]] += 1
  else:
    dict[str[i]]  = 1

    
for val in dict.values():
  if(val %2 != 0):
    isBeautiful = False

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

Solution (Python):
import collections
s = input()
m = collections.Counter(s)

if len(list(filter(lambda x:x%2 == 1,m.values())))  > 0:
  print("No")
else:
  print("Yes")

Solution (Python):
import string

w = input()

ans = 'Yes'
for i in range(len(string.ascii_lowercase)):
	if w.count(string.ascii_lowercase[i:i+1])%2!=0:
		ans = 'No'
		break

print(ans)

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

Solution (Python):

from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007


"""
n,k,x,y = IR(4)
print(min(k,n)*x+max(n-k,0)*y)
"""

w = S()
d = defaultdict(int)
for i in w:
    d[i] += 1
for i in d.values():
    if i%2:
        print("No")
        quit()
print("Yes")

"""
n,a = LI()
x = LI()
s = sum(x)
dp = [[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
for i in range(n+1):
    dp[i][0][0] = 1
for i in range(1,n+1):
    for j in range(1,n+1):
        for k in range(s+1):
            if k >= x[i-1]:
                dp[i][j][k] = dp[i-1][j][k]+dp[i-1][j-1][k-x[i-1]]
            else:
                dp[i][j][k] = dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
    if a*i <= s:
        ans += dp[n][i][a*i]
print(ans)
"""


"""
def f(b,n):
    m = n
    res = 0
    while m > 0:
        res += m%b
        m //= b
    return res
n,s = IR(2)
if n == s:
    print(n+1)
    quit()
if n == 1:
    print(-1)
    quit()
k = int(n**0.5)
for b in range(2,k+1):
    if f(b,n) == s:
        print(b)
        quit()
for p in range(1,k+1)[::-1]:
    if (n-s)%p == 0:
        b = (n-s)//p+1
        if b != 0:
            if f(b,n) == s:
                print(b)
                quit()
print(-1)
"""

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 = input()
l = list(w)
s = set(l)
for i in s:
    if l.count(i)%2!=0:
        print("No")
        exit()
else:
    print("Yes")

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

Solution (Python):

w = input()
o = []
for i in range(len(w)):
    o.append(ord(w[i]))

c = [0] * 26
for i in range(len(w)):
    c[o[i] - 97] += 1

i = 0
while i < 26:
    if c[i] % 2 == 0:
        i += 1
    else:
        print('No')
        break
if i == 26:
    print('Yes')

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

w_list = list(w)

str_list = [chr(i) for i in range(97, 97+26)]

count = 0

for char in str_list:
	if w_list.count(char)%2 == 0:
		count +=1
	else:
		print("No")
		break
	if count == 26:
		print("Yes")

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

c = collections.Counter(s)

if len(list(filter(lambda x:x%2==1,c.values()))) > 0:
    print("No")
else:
    print("Yes")

Solution (Python):
w = input()
word_list = [chr(i + 96) for i in range(1, 27)]
check = True
for word in word_list:
    if w.count(word) % 2 != 0:
        check = False
        break
print('Yes' if check else 'No')

Solution (Python):
S = input()

def unique_list(seq):
    seen = set()
    seen_add = seen.add
    return [x for x in seq if x not in seen and not seen_add(x)]


def solve():
    ul = unique_list(S)
    for w in ul:
        if not S.count(w) % 2 == 0:
            return "No"

    return "Yes"


res = solve()
print(res)

Solution (Python):
def main():
    w = input()
    cnt = {}
    for c in w:
        if c not in cnt:
            cnt[c] = 0
        cnt[c] += 1
    for k in cnt:
        if cnt[k] % 2 == 1:
            print("No")
            return
    print("Yes")


if __name__ == "__main__":
    main()

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

Solution (Python):
s = input()

dic = {}

for i in s:
    if i in dic.keys():
        dic[i] += 1
    else:
        dic[i] = 1

for i in dic:
    if dic[i] % 2 == 0:
        continue
    print('No')
    exit()
print('Yes')

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

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

Solution (Python):


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

Solution (Python):



w = input()
s = list(w)

l = []


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

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

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

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

Solution (Python):
s = input()

n = len(s)
k = 0

for i in range(n):
    c = s.count(s[i])
    k += 1
    if c % 2 != 0:
        print('No')
        break
    
    if k == n:
        print('Yes')