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):
from collections import Counter
W = Counter(list(input()))
Flag = True
for TW in W:
    if W[TW]%2!=0:
        Flag = False
        break
print(['No','Yes'][Flag])

Solution (Python):
def resolve():
    '''
    code here
    '''
    import collections
    w = input()
    cnt = collections.Counter(w)

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

if __name__ == "__main__":
    resolve()

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

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

length = len(w)
z = sorted(w)
i=1
m=0
   
if length%2 == 1:
    m = 1
    pass
else:
    while i < length:        
        if z[i]==z[i-1]:
            i += 2
        else:
            m = 1
            break
        
if m == 1:
    print("No")
else:
    print("Yes")

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

print('Yes')

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

beautiful = True
for i in alp:
    if w.count(i)%2 != 0:
        beautiful = False
        break
        
if beautiful:
    print('Yes')
else:
    print('No')

Solution (Python):
S = str(input())
Flag = False

for i in S:
    if not S.count(i) % 2 == 0:
        Flag = True

if Flag:
    print('No')

else:
    print('Yes')

Solution (Python):
from collections import Counter
cnt=Counter(input())
print('No' if any([x&1 for x in cnt.values()]) else 'Yes')

Solution (Python):
a = input()
b = []
c = int(len(a))
import collections

for i in range(c):
  b.append(a[i])

d = collections.Counter(b)
e = []

for i in d.values():
  e.append(i)

f = int(len(e))
g = int(0)

for i in range(f):
  if int(e[i]) % 2 == 0:
    pass
  else:
    g = g + 1

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

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

Solution (Python):
from collections import *
s=input()
c=Counter(s)
f=0
for i in list(c.values()):
    if(i%2==1):
        f=1
        break
if(f==0):
    print('Yes')
else:
    print('No')

Solution (Python):
w = input()

group = set(w)

count = []
for i in group:
    count.append(w.count(i))

ans = 0

for j in count:
    if j % 2 == 1:
        ans = 1
    else:
        pass

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

Solution (Python):

def resolve():
    import sys
    input = sys.stdin.readline
    
    
    w = input().rstrip()

    import string

    result = {alp: True for alp in string.ascii_lowercase}

    for c in w:
        result[c] = not result[c]

    if all(result.values()):
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    resolve()

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())

l = list(Counter(s).values())
for i in range(len(l)):
    if l[i] % 2 == 1:
        print('No')
        exit()
print('Yes')

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

W.sort()

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

for i in range(len(w)//2):
    if not W[2*i] == W[2*i+1]:
        print("No")
        exit()
print("Yes")

Solution (Python):
S = input()
flag = True

if S.count('a') % 2 == 1:
  flag = False
elif S.count('b') % 2 == 1:
  flag = False
elif S.count('c') % 2 == 1:
  flag = False
elif S.count('d') % 2 == 1:
  flag = False
elif S.count('e') % 2 == 1:
  flag = False
elif S.count('f') % 2 == 1:
  flag = False
elif S.count('g') % 2 == 1:
  flag = False
elif S.count('h') % 2 == 1:
  flag = False
elif S.count('i') % 2 == 1:
  flag = False
elif S.count('j') % 2 == 1:
  flag = False
elif S.count('k') % 2 == 1:
  flag = False
elif S.count('l') % 2 == 1:
  flag = False
elif S.count('m') % 2 == 1:
  flag = False
elif S.count('n') % 2 == 1:
  flag = False
elif S.count('o') % 2 == 1:
  flag = False
elif S.count('p') % 2 == 1:
  flag = False
elif S.count('q') % 2 == 1:
  flag = False
elif S.count('r') % 2 == 1:
  flag = False
elif S.count('s') % 2 == 1:
  flag = False
elif S.count('t') % 2 == 1:
  flag = False
elif S.count('u') % 2 == 1:
  flag = False
elif S.count('v') % 2 == 1:
  flag = False
elif S.count('w') % 2 == 1:
  flag = False
elif S.count('x') % 2 == 1:
  flag = False
elif S.count('y') % 2 == 1:
  flag = False
elif S.count('z') % 2 == 1:
  flag = False

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

Solution (Python):
import collections
w = input()
_dict = collections.Counter([x for x in w])
flag = True
for i in _dict.values():
    if i%2 == 1:
        flag = False
        break
if flag:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):

w = list(input())

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

Solution (Python):
W = input()
W_list = set(list(s for s in W))
ans = True 
for s in W_list:
    if W.count(s) % 2 != 0:
        ans = False
        break


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

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

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):
w = input()
d = {}
for s in w:
    if d.get(s, -1) == -1:
        d[s] = 1
    else:
        d[s] += 1
good = True
for key in d:
    if d[key] % 2 != 0:
        good = False
        break
print('Yes' if good else 'No')

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

s = rr()
c = collections.Counter(s)
for i in c.values():
  if i & 1:
    print('No')
    exit()
print('Yes')

Solution (Python):

def main():
    import collections

    w = input()

    w_c = collections.Counter(w)

    for v in w_c.values():
        if v % 2 != 0:
            print('No')
            exit()
    else:
        print('Yes')
        

    
if __name__ ==  "__main__":
    main()

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

Solution (Python):
from collections import Counter

f = True
s = Counter(input())
for i in list(s.values()):
    if i % 2 != 0:
        f = False

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

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

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

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

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

Solution (Python):
from collections import Counter

c = Counter(input())

for k in c.keys():
  if c[k] % 2 == 1:
    print('No')
    exit()
    
print('Yes')

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

Solution (Python):
w1 = str(input())
w2 = []
for i in range(len(w1)):
    w2.append(w1[i])
from collections import Counter
w = Counter(w2).most_common()
x = 'Yes'
for h in range(len(w)):
    if w[h][1]%2 != 0:
        x = 'No'
        break
print(x)

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

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

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

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

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

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

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

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

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

Solution (Python):
w = list(input())
j = 0
ans = 0

if(len(w)%2 != 0):
    print('No')
else:
    for i in range(len(w)):
        j = w.count(w[i])
        if(j%2 == 0 and i == len(w)-1):
            print('Yes')
            break
        elif(j%2 != 0):
            print('No')
            break

Solution (Python):
s = input()
ss =set(s)
cnt = 0
for i in ss:
  if s.count(i)%2 !=0:
    cnt =1
print("Yes" if cnt ==0 else "No")

Solution (Python):
s = input()

lst = []

for i in range(len(s)):
   lst.append(s[i])

lst2 = list(set(lst))

result = 'Yes'

for i in lst2:
   if lst.count(i) % 2 != 0:
      result = 'No'

print(result)

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

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

Solution (Python):
import sys
from collections import Counter


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

w = input()

c = Counter(w)

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

print("Yes")

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

for i in range(W):
    if w.count(w[i])%2==0:
        if i==W-1:
            print("Yes")
            break
  
    else:
        print("No")
        break

Solution (Python):
str1 = input()
wo = list(str1)
li = [0 for i in range(26)]
for i in range(len(wo)):
    li[ord(wo[i])-97] += 1
flag = True
for i in range(26):
    if li[i] % 2 != 0:
     flag = False
if flag:
    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()

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

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

Solution (Python):
w=input()

while True:
  w1=w[0]
  s=w.count(w1)
  if s%2!=0:
    print("No")
    break
  w=w.replace(w1,"")
  if w=="":
    print("Yes")
    break

Solution (Python):
s=input()
li=[0]*26
for i in range(len(s)):
    li[ord(s[i])-97]+=1
res="Yes"
for i in li:
    if i%2==1:
        res="No"
print(res)

Solution (Python):
w = input()
tf = True

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

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

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

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

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

Solution (Python):







w = input()

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

print("Yes")

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

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

w.sort()
c = 1
p = w[0]
for i in range(1,len(w)):
    if p == w[i]:
        c += 1
    else:
        if c%2 == 1:
            print('No')
            exit()
        c = 1
        p = w[i]

if len(w) == 1:
    print('No')
    exit()

print('Yes')

Solution (Python):
from collections import Counter
flg = True
c = Counter(input())

for v in c.values():
  flg = flg and v % 2 == 0

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

Solution (Python):
S = input()
m = {}

for s in S:
  if s not in m:
    m[s] = 0
  m[s] += 1

for k in m.keys():
  if m[k] % 2 != 0:
    print('No')
    exit()

print('Yes')

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

Solution (Python):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

from collections import Counter
ans = True

x = Counter(input())
for k, v in x.items():
    if v % 2 == 1:
        ans = False
if ans:
    print("Yes")
else:
    print("No")

Solution (Python):
import collections

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

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

w = input()
import collections
c = collections.Counter(w)
for k, v in c.items():
    if v % 2 != 0:
        print('No')
        quit()
print('Yes')

Solution (Python):
w = input()
A = [0] * 26

for i in w:
    A[ord(i) - 97] += 1

flag = True
for a in A:
    if a % 2 == 1:
        flag = False


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

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

Solution (Python):
w = input()

if len(w) % 2 != 0:
    print('No')
    exit()

cnt = [0]*30
for i in range(len(w)):
    a = ord(w[i]) - ord('a')
    cnt[a] += 1

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

print('Yes')

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

Solution (Python):
from collections import Counter


def main():
    w = list(input())
    w_counter = Counter(w)
    ans = 'Yes'
    for key, value in w_counter.items():
        if value % 2 != 0:
            ans = 'No'
            break
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import collections
w=str(input())
cc=collections.Counter(w)

a=list(cc.values())
for ans in a:
    if ans%2!=0:
        print('No')
        exit()
    
print('Yes')

Solution (Python):
w = input()

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

print('Yes')

Solution (Python):
import math
import collections
import fractions
import itertools
import functools
import operator

def solve():
    w = input()
    c = collections.Counter(w)
    for i in c:
        if c[i] % 2 == 1:
            print("No")
            exit()
    print("Yes")
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
import sys
def LS2(): return list(sys.stdin.readline().rstrip())  

w = LS2()

from collections import Counter

c = Counter(w)
a = sum(c[i] % 2 != 0 for i in c.keys())
print('Yes' if a == 0 else 'No')

Solution (Python):
def main():
    s=input()
    x=set(s)
    for i in x:
        if(s.count(i)%2==1):
            print('No')
            return;
    print('Yes')

main()

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

for letter in s:
  if letter in d:
    d[letter] += 1
  else:
    d[letter] = 1
flag = 1  
for key in d:
  if d[key]%2 != 0:
    flag = 0
	
if flag == 1:
  print("Yes")
else:
  print("No")

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

Solution (Python):
flag = 1
s = input()
d = {}
for i in s:
  if i in d:
    d[i] += 1
  else:
    d[i] = 1

for key in d:
    if d[key] %2 != 0:
      flag = 0     
if flag == 0:
    print("No")
else:
    print("Yes")

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

Solution (Python):
def main():
    w = list(input())
    oklist=[]
    for i in range(len(w)):
        w1 = w.count(w[i])
        if w1 % 2 != 0:
            oklist.append(1)
    if oklist == []:
        print('Yes')
    else:
        print('No')
    
    
if __name__ == '__main__':
  main()

Solution (Python):
from collections import Counter
S = Counter(input())
flag = True
for c in S.values():
  if c % 2 == 1:
    flag = False
if flag:
  print('Yes')
else:
  print('No')

Solution (Python):
w = input()

s = "abcdefghijklmnopqrstuvwxyz"

dic = {}

for o in s:
    dic[o] = 0

for o in w:
    dic[o] += 1

for num in dic.values():
    if num % 2 == 1:
        print("No")
        exit()

print("Yes")

Solution (Python):


def main():

    w = input()
    setW = set(w)
    listW = list(w)
    n = len(listW)

    for i in setW:
        if listW.count(i) % 2 == 1:
            ans = 'No'
            break

        else:
            ans = 'Yes'

    print(ans)

if __name__ == "__main__":
    main()

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

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

Solution (Python):
W = input()

ok = [True] * 26

for w in W:
    idx = ord(w) - ord("a")
    ok[idx] = not ok[idx]

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

Solution (Python):


alpha = {
    'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z',
}

S = input()

flg = True
for a in alpha:
    if S.count(a) % 2 != 0:
        flg = False
        break

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

Solution (Python):
w=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 defaultdict
d=defaultdict(int)
s=input()
for i in s:
    d[i]+=1
for v in d.values():
    if v%2==1:
        print("No")
        exit()
print("Yes")

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

Solution (Python):
from collections import Counter
w = [c for c in str(input())]
ans = 'Yes'
for k, v in Counter(w).items():
    if v % 2 == 1:
        ans = 'No'
        break
print(ans)

Solution (Python):
w = input()
dict = {}
for i in w:
  if i not in dict:
    dict[i] = 1
  else:
    dict[i] +=1
for key, value in dict.items():
  if value % 2 != 0:
    print("No")
    exit()
print("Yes")

Solution (Python):
s = input()
check = 0
flag = True
for i in range(97,123):
  check =s.count(chr(i))
  if check % 2 == 1 :
    flag = False
if flag:
  print("Yes")
else:
  print("No")

Solution (Python):
from collections import defaultdict
s=input()
dd=defaultdict(lambda: True)
for c in s:
  dd[c]=not dd[c]
for k in dd:
  if not dd[k]:
    print("No")
    exit()
print("Yes")

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

Solution (Python):
import collections
W=collections.Counter(x for x in input())

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

Solution (Python):
s = input()
d = {}
flag = 1
for i in s:
    d.setdefault(i, 0)
    d[i] += 1


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

Solution (Python):
s = input()
d = {}
flag = 1
for i in s:
    if i in d:
        d[i] += 1
    else:
        d.setdefault(i, 1)
    
for j in d.values():
    if j % 2 != 0:
        flag = 0
if flag == 0:
    print("No")
else:
    print("Yes")

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

C = Counter(S)

ok = True
for s,x in C.items():
  if x % 2 != 0:
    ok = False
    break

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

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

Solution (Python):
s = input()
alp=[0 for i in range(0, 28)]
for j in s:
	if j>='a' and j<='z':
		alp[(ord(j)-ord('a'))]=alp[(ord(j)-ord('a'))]+1
f=0
for i in range(0 ,26):
	if alp[i]%2!=0:
		f=1
if f==1:
	print("No")
else:
	print("Yes")

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

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

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

Solution (Python):
import sys
from collections import Counter

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    w = readline().strip()
    c = Counter(w)

    ok = True
    for v in c.values():
        if v % 2:
            ok = False
            break

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

    return


if __name__ == '__main__':
    main()

Solution (Python):

import sys

w = list(input())
w_set = set(w)
for i in w_set:
  if w.count(i)%2==1:
    print("No")
    sys.exit()
  else:
    continue
print("Yes")

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

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

lis = collections.Counter(w)

for key, value in lis.items():
    if value % 2 != 0:
        print('No')
        exit()

print('Yes')

Solution (Python):
w = input()

from collections import Counter
A = Counter(w)

ans="No"
for k,v in Counter(A).items():
  if v%2==1: break
else:
  ans="Yes"
print(ans)

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

ans = "Yes"

for i in s:
    num = S.count(str(i))
    if num % 2 == 1:
        ans = "No"

print(ans)

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

a = 0
b = 0
c = 0
d = 0
e = 0
f = 0
g = 0
h = 0
i = 0
j = 0
k = 0
l = 0
m = 0
n = 0
o = 0
p = 0
q = 0
r = 0
s = 0
t = 0
u = 0
v = 0
w = 0
x = 0
y = 0
z = 0

for ii in range(len(ww)):
    if ww[ii] == "a":
        a +=1
    if ww[ii] == "b":
        b+=1
    if ww[ii] == "c":
        c +=1
    if ww[ii] == "d":
        d +=1
    if ww[ii] == "e":
        e+=1
    if ww[ii] == "f":
        f +=1
    if ww[ii] == "g":
        g +=1
    if ww[ii] == "h":
        h +=1
    if ww[ii] == "i":
        i +=1
    if ww[ii] == "j":
        j +=1
    if ww[ii] == "k":
        k +=1
    if ww[ii] == "l":
        l +=1
    if ww[ii] == "m":
        m +=1
    if ww[ii] == "n":
        n +=1
    if ww[ii] == "o":
        o +=1
    if ww[ii] == "p":
        p +=1
    if ww[ii] == "q":
        q +=1
    if ww[ii] == "r":
        r +=1
    if ww[ii] == "s":
        s +=1
    if ww[ii] == "t":
        t +=1
    if ww[ii] == "u":
        u +=1
    if ww[ii] == "v":
        v +=1
    if ww[ii] == "w":
        w +=1
    if ww[ii] == "x":
        x +=1
    if ww[ii] == "y":
        y +=1
    if ww[ii] == "z":
        z +=1

if a%2==0 and b%2==0 and c%2==0 and d%2==0 and e%2==0 and f%2==0 and g%2==0 and h%2==0 and i%2==0 and j%2==0 and k%2==0 and l%2==0 and m%2==0 and n%2==0 and o%2==0 and p%2==0 and q%2==0 and r%2==0 and s%2==0 and t%2==0 and u%2==0 and v%2==0 and w%2==0 and x%2==0 and y%2==0 and z%2==0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
from collections import Counter
w = list(input())
c = Counter(w)
f = True
for i in list(c.values()):
    if i % 2 == 1:
        f = False
        break

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

Solution (Python):

import sys
w = input()
c = w.lower()
mozi = []

if w !=c:
    print("No")
    sys.exit()
    
for i in range(len(w)):
    mozi.append(w[i])
    
for i in mozi:
    if w.count(i) % 2 == 1:
        print("No")
        sys.exit()
    
print("Yes")

Solution (Python):
W = input()
f = True
for w in set(W):
    if W.count(w) % 2 != 0:
        f = False
if f:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()
beau = {}
for i in range(len(w)):
    if not w[i] in beau:
        beau[w[i]] = 1
    else:
        beau[w[i]] += 1
num = sum(list(map(lambda x: x%2,list(beau.values()))))
if num == 0:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
NN = input()
total = 0
for i in NN:
  a = NN.count(i)
  if a%2 ==0:
    pass
  else:
    total +=1
if total ==0:
  print('Yes')
else:
  print('No')

Solution (Python):
def resolve():
    w = input()
    w_list = list(w)
    for char in set(w_list):
        if w.count(char) % 2 == 1:
            print("No")
            return
    print("Yes")

resolve()

Solution (Python):



import io
import sys
import math

CASES = "abcdefghijklmnopqrstuvwxyz"

def solve(s):
    
    for c in CASES:
        if s.count(c) % 2 != 0:
            return "No"
    return "Yes"

def main():
    
    s = input()
    
    
    ans = str( solve(s) )
    
    
    print(ans)
    return ans
        

_DEB = 0   

_INPUT = """\
abaccaba
"""
_EXPECTED = """\
Yes

"""

def logd(str):
    if _DEB: print(f"[deb] {str}")


if __name__ == "__main__":
    if _DEB:
        sys.stdin = io.StringIO(_INPUT)
        print("!! Debug Mode !!")

    ans = main()

    if _DEB:
        print()
        if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
        else: print(f"!! Failed... !!\nANSWER:   {ans}\nExpected: {_EXPECTED}")

Solution (Python):
w = input()

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

print("Yes")

Solution (Python):
from collections import Counter
w = Counter(input())
for i in w.values():
    if i&1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w = list(input())
w.sort()
c = 0
flag = 0
if len(w) % 2 == 0:
    for i in range(round(len(w) / 2)):
        if w[c] != w[c + 1]:
            flag = 1
            break
        c += 2
    if flag == 1:
        print("No")
    else:
        print("Yes")
else:
    print("No")

Solution (Python):
w = list(input())
alpha = list("qwertyuiopasdfghjklzxcvbnm")
FLAG = True
for i in alpha:
  cnt = w.count(i)
  if cnt == 0:
    continue
  elif cnt % 2 == 0:
    continue
  else:
    print("No")
    FLAG = False
    break
while FLAG:
  print("Yes")
  break

Solution (Python):
s = input()

x = list(s)
x.sort()

answer1 = []
answer2 = []

for num in x:
    if len(answer1) == len(answer2):
        answer1.append(num)
    else:
        answer2.append(num)

if answer1 == answer2:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]

from collections import Counter
c = Counter(rs())
ans = 'Yes'
for i in c.values():
    if i % 2 == 1:
        ans = 'No'
print(ans)

Solution (Python):
w = input ()
while len(w) != 0:
  if (w.count(w[0]))%2 == 1:
    print ('No')
    x = 0
    break
  else:
    x = w[0]
    w = w.replace(x,'')
if x != 0:
  print ('Yes')

Solution (Python):
import sys
w = input()
d = {}
for c in range(97,97+26):
    d[chr(c)]=0
for c in w:
    d[c]+=1

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

print("Yes")

Solution (Python):
import sys

w = input()
W = [0] * 26
for _w in w:
    W[ord(_w) - ord('a')] += 1
for _w in W:
    if _w % 2 != 0:
        print('No')
        sys.exit()
print('Yes')

Solution (Python):
s=input()
print('NYoe s'[all(s.count(i)%2==0 for i in s)::2])

Solution (Python):
s=input()
n=0
while True:
    i=s[0]
    if s.count(i) % 2 == 0:
        s=s.replace(i,'')
        if s == '':
            break
        continue
    n+=1
    break
print('YNeos'[n::2])