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


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

ans = 'Yes'
for key in d:
    if d[key] % 2 == 1:
        ans = 'No'
        break


print(ans)

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

Solution (Python):
w = input()
d = {}
for c in w:
  if c in d:
    d[c] = not d[c]
  else:
    d[c] = True

for f in d.values():
  if f:
    print("No")
    exit()
print("Yes")

Solution (Python):
w = input()
G = []
q = 0
for x in w:
    if not ([x, True] in G or [x, False] in G):
        G.append([x, True])
    else:
        if [x, True] in G:
            G[G.index([x, True])][1] = False
        else:
            G[G.index([x, False])][1] = True
for h in range(len(G)):
    q += G[h][1]

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

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

Solution (Python):
import collections
c=collections.Counter(list(input()))
cv=list(c.values())
ans=0
for i in range(len(cv)):
    if cv[i]%2==1:
        ans+=1
print('YNeos'[ans>0::2])

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

Solution (Python):
def main():
	string = str(input())
	dp = [0 for _ in range(26)]
	for i in range(len(string)):
		dp[ord(string[i])-ord('a')]+=1
	for x in dp:
		if x%2!=0:
			print("No")
			return 
	print("Yes")
	return
main()

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

flag=1
for i in x:
  if w.count(i)%2!=0:
    flag=0
    break
print('Yes' if flag==1 else 'No')

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



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

Solution (Python):
import sys
w=input()
x='abcdefghijklmnopqrstuvwxyz'
for i in range(26):
  if w.count(x[i]) % 2 > 0:
    print('No')
    sys.exit()

print('Yes')

Solution (Python):
s = input()
ans = 'Yes'
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
for c in ascii_lowercase:
    if s.count(c) % 2 == 1:
        ans = 'No'
print(ans)

Solution (Python):
import collections

w=input()
a=[]
for i in range(len(w)):
  a.append(w[i])
c = collections.Counter(a)
b=list(c.values())
flag="T"
for i in range(len(b)):
  if b[i]%2!=0:
    print("No")
    flag="F"
    break
if flag=="T":
  print("Yes")

Solution (Python):
from collections import defaultdict

w = input()
cnt = defaultdict(int)

for i in range(len(w)):
    cnt[w[i]] += 1

for k, v in cnt.items():
    if v % 2 == 1:
        print("No")
        exit()

print("Yes")

Solution (Python):

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

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

Solution (Python):
from collections import Counter
w = input()
ans = "Yes"
if len(w) ^ 1:
    d = Counter(w)
    for c in d:
        if d[c] & 1:
            ans = "No"
            break
else:
    ans = "No"
print(ans)

Solution (Python):
ans = True
w = input()
for c in w: ans &= w.count(c)%2 == 0
print("Yes" if ans else "No")

Solution (Python):
from collections import Counter
w = input()
c = Counter()
for iw in w:
    c[iw]+=1
f = True
for v in c.values():
    if v%2!=0:
        f = False
        break
if f:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
from collections import Counter

input = sys.stdin.readline


def main():
    w = input().rstrip()

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

    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
w = list(input())
A = [ 0 for _ in range(26)]
for c in w:
    i = ord(c) - ord("a")
    A[i]+=1
ans = "Yes"
for a in A:
    if a%2 == 1:
        ans = "No"
        break
print(ans)

Solution (Python):
import collections
def calc_double(n):
    return n%2
a=input()
b=collections.Counter(a)
values=zip(*b.most_common())
c=list(values)
e=c[1]
d=list(map(int,e))
if sum(map(calc_double,d))==0:
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter

C = Counter(list(input()))

ans = 'No' if any(x % 2 for x in list(C.values())) else 'Yes'
print(ans)

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

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


for i in count.values():
	if not i%2 == 0:
		print("No") 
		break
else:
	print("Yes")

Solution (Python):
s = input()
for i in range(26):
    n = s.count(chr(ord('a')+i))
    if n%2==1:
        print('No')
        break
    if i == 25:
        print('Yes')

Solution (Python):
s = input()
alp = [0 for _ in range(26)]

for c in s:
    alp[ord(c) - ord('a')] += 1

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

Solution (Python):
import collections

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

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

print("Yes")

Solution (Python):
a = input()

for i in range(0,len(a)):
  c = 0
  for j in range(0,len(a)):
    if(a[i] == a[j]):
      c = c + 1
    else:
      continue
  if(c%2 != 0):
    print("No")
    exit()
  else:
    continue
    
print("Yes")

Solution (Python):
import sys
from collections import Counter

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    w = input()
    D = Counter(w)
    for v in D.values():
        if v % 2 != 0:
            print("No")
            break
    else:
        print("Yes")


if __name__ == '__main__':
    resolve()

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

Solution (Python):
import sys
s = input()
n = len(s)

if n %2 != 0:
    print('No')
    sys.exit()
for i in range(97,124): 
    if s.count(chr(i)) %2 != 0:
        print('No')
        sys.exit()
print('Yes')

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

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

Solution (Python):
from collections import defaultdict
d = defaultdict(int)
w = input()

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

t = True
for key, v in d.items():
    if (v % 2 == 0):
        continue
    else:
        t = False
        break

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

Solution (Python):
w = input()
ans = 1

for wi in w:
    ans ^= ord(wi)

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

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

Solution (Python):
w = input()
asci = 0
for i in w:
  asci = asci^ord(i)
if asci == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
from collections import Counter
list_S = list(input())
list_C = Counter(list_S).values()

ans = "Yes"
for num in list_C:
    if num % 2 != 0:
        ans = "No"
        break

print(ans)

Solution (Python):
w = input()

d = {}
for c in w:
    if c in d.keys():
        d[c] += 1
    else:
        d.setdefault(c, 1)
for i, j in d.items():
    if j % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
w = str(input())
List = [w[i] for i in range(len(w))]
lis = sorted(List)

uni = list(set(lis))

ans = []
q = 0
for i in range(len(uni)):
    p = lis.count(uni[i])
    ans.append(p)
for j in range(len(ans)):
    q += ans[j]%2
if q == 0:
    print("Yes")
else:
  print("No")

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

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

Solution (Python):
from collections import Counter

w = input()
c = Counter(w)

ans = "Yes"

for v in c.values():
    if v % 2 == 1:
        ans = "No"

print(ans)

Solution (Python):
from collections import Counter

w = input()
c = Counter(w)

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

print("Yes")

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

flag = 0
for i in range(len(w)):
    if w.count(w[i]) % 2 == 0:
        flag = 0
    else:
        flag = 1
        break

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

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

Solution (Python):
import sys
from collections import Counter
readline = sys.stdin.buffer.readline
MOD = 10**9+7

def main():
    w = input()
    cnt = Counter(w)
    ans = 'Yes'
    for i in cnt.values():
        if i&1:
            ans = 'No'
    print(ans)



if __name__ == '__main__':
    main()

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

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

Solution (Python):
from collections import Counter
w=list(input())
a=Counter(w)
b=list(a.values())

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

Solution (Python):
S=str(input())
s_list = "abcdefghijklmnopqrstuvwxyz"
n_list = []
for i in range(26):
  n_list.append(0)
for i in range(len(S)):
  n_list[s_list.index(S[i])] = n_list[s_list.index(S[i])] + 1
num = 1
for i in range(26):
  num = num * (n_list[i]+1)
if num % 2 == 1:
  print('Yes')
else:
  print('No')

Solution (Python):
import collections

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

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

print("Yes")

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

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

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

Solution (Python):
w = input()

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

Solution (Python):
from collections import defaultdict


def main():
    S = input()
    d = defaultdict(int)
    for c in S:
        d[c] += 1
    for n in d.values():
        if n % 2 == 1:
            print('No')
            exit()
    print('Yes')


if __name__ == '__main__':
    main()

Solution (Python):
w = input()
len_w = len(w)
w = sorted(w)
moji = [chr(i) for i in range(97, 123)]
l = [0]*len_w
for i in range(len_w):
    if w.count(w[i]) % 2 != 0:
        print("No")
        quit()
print("Yes")

Solution (Python):
w = list(map(str,input()))
w.sort()
w = "".join(w)

flag = 0
w = [w[i*2:i*2+2] for i in range(-(-len(w)//2))]
for i in w:
  if len(i)==1 or not i[0] == i[1]:
    flag = 1
    break

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

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

Solution (Python):
from collections import Counter
w = input()
ww = Counter(w)
ans = "No"
for i in ww:
    if ww[i] % 2 == 0:
        ans = "Yes"
    else:
        ans = "No"
        break
print(ans)

Solution (Python):
w = input()
strlist = ["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"]
def search():
    for i in strlist:
        if w.count(i) % 2 == 1:
            return "No"
    return "Yes"
print(search())

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

for i in range(len(w)):
    if w[i]=="a":
        l[0]+=1
    elif w[i]=="b":
        l[1]+=1
    elif w[i]=="c":
        l[2]+=1
    elif w[i]=="d":
        l[3]+=1
    elif w[i]=="e":
        l[4]+=1
    elif w[i]=="f":
        l[5]+=1
    elif w[i]=="g":
        l[6]+=1
    elif w[i]=="h":
        l[7]+=1
    elif w[i]=="i":
        l[8]+=1
    elif w[i]=="j":
        l[9]+=1
    elif w[i]=="k":
        l[10]+=1
    elif w[i]=="l":
        l[11]+=1
    elif w[i]=="m":
        l[12]+=1
    elif w[i]=="n":
        l[13]+=1
    elif w[i]=="o":
        l[14]+=1
    elif w[i]=="p":
        l[15]+=1
    elif w[i]=="q":
        l[16]+=1
    elif w[i]=="r":
        l[17]+=1
    elif w[i]=="s":
        l[18]+=1
    elif w[i]=="t":
        l[19]+=1
    elif w[i]=="u":
        l[20]+=1
    elif w[i]=="v":
        l[21]+=1
    elif w[i]=="w":
        l[22]+=1
    elif w[i]=="x":
        l[23]+=1
    elif w[i]=="y":
        l[24]+=1
    elif w[i]=="z":
        l[25]+=1
for i in range(26):
    if l[i]%2!=0:
        print("No")
        exit()
print("Yes")

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    S = iss()
    st = set(S)
    ret = [False] * len(st)
    i = 0
    for s in st:
        if S.count(s) % 2 == 0:
            ret[i] = True
        i+=1
    print('Yes' if all(ret) else 'No')


if __name__ == '__main__':
    main()

Solution (Python):
import collections

w = input()
counter = collections.Counter(w)
ans = "Yes"
for x in counter.values():
    if x % 2 != 0:
        ans = "No"
        break

print(ans)

Solution (Python):
from collections import Counter

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

Solution (Python):
w = input()

def f (w):
    for s in w:
        if w.count(s) % 2 != 0:
            return 0
    return 1

if f(w) == 1:
    print("Yes")
else:
    print("No")

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

n = int(0)

for i in w:
    if w.count(i) %2 == 1:
        n +=1

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

Solution (Python):
from collections import Counter

c = Counter(list(input()))

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

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

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

for i in range(26):
  tmp = w.count(chrs[i])
  lis[i] = tmp

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

Solution (Python):
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

from collections import Counter

w = ns()
c = Counter(w)
flag = True
for k, v in c.items():
    if v % 2 != 0:
        flag = False

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

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

Solution (Python):
w = list(input())
w.sort()
array = []
allset = list(set(w))
allset.sort()
index = 0
lettercount = 0
bad_letter = 0
indexs = []

for i in range(len(w) - 1):
    if w[i] != w[i+1]:
        indexs.append(i+1)
indexs.append(len(w))

for i in indexs:
    if i % 2 != 0:
        bad_letter += 1

print("No") if bad_letter > 0 else print("Yes")

Solution (Python):
s = input()
n = len(s)
key = dict()
for i in range(n):
  if s[i] not in key:
    key[s[i]] = 1
  else:
    key[s[i]] += 1
ans = True
for value in key.values():
  if value%2 == 1:
    print("No")
    ans = False
    break
if ans:
  print("Yes")

Solution (Python):
import sys
S = input()
alp = list(set(S))
cnts = [0] * len(alp)
for i in range(len(S)):
    cnts[alp.index(S[i])] += 1
    
for a in cnts:
    if a%2 == 1:
        print("No")
        sys.exit()
print("Yes")

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

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

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

flag = True
for k, v in w.items():
  if v % 2 != 0:
    flag = False
    break
print("Yes" if flag else "No")

Solution (Python):


from collections import deque,Counter





import numpy as np




W = input()

count = Counter(W)
arr = np.array(list(count.values()))
arr = arr%2

ans = "Yes"
if 1 in arr:
    ans = "No"

print(ans)

Solution (Python):
w = input()

a = {}

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

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

print('Yes')

Solution (Python):
import sys
read = sys.stdin.buffer.read

from collections import Counter

print('Yes' if all(v % 2 == 0 for v in Counter(read().rstrip().decode()).values()) else 'No')

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

from collections import Counter

for check in list(Counter(read().rstrip().decode()).values()):
    if check % 2 == 1:
        print('No')
        exit()
print('Yes')

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

Solution (Python):
W = input()
cnt = [0] * 300
for w in W:
    cnt[ord(w)] += 1

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

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

Solution (Python):
icase=0
if icase==0:
    import sys
    ws=input()
    w=list(ws)
    ww=set()
    for i in range(len(w)):
        if not w[i] in ww:
            ww.add(w[i])
    for www in ww:
        if ws.count(www)%2==1:
            print("No")
            sys.exit()
    print("Yes")

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

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

Solution (Python):
arg=list(input())
word=set(arg)
for i in word:
  n = sum(x==i for x in arg)
  if n%2!=0:
    print('No')
    break
else:
  print('Yes')

Solution (Python):
arg=list(input())
word=set(arg)
for i in word:
  n = sum(x==i for x in arg)
  if n%2!=0:
    print('No')
    break
else:
  print('Yes')

Solution (Python):
w=input()
L=len(w)
check=0
for i in range(0,L):
    a=w.count(w[i])
    if a%2==0:
        check+=1
    else:
        pass
if check==L:
    print("Yes")
else:
    print("No")

Solution (Python):
def resolve():
	w = input()
	uniq = []
	cnt = []
	for i in w:
		if i not in uniq:
			uniq.append(i)
	for i in uniq:
		cnt.append(w.count(i))
	ans = "Yes"
	for i in cnt:
		if i % 2 != 0:
			ans = "No"
			break
	print(ans)
resolve()

Solution (Python):
from collections import Counter

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

Solution (Python):
from collections import defaultdict

w = input()
d = defaultdict(int)

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

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

Solution (Python):
def myAnswer(w:list) -> str:
   dic = dict()
   for i in w:
      if(i in dic.keys()):
         dic[i]+=1
      else:
         dic[i]=1
   for value in dic.values():
      if(value%2 == 1):
         return "No"
   return "Yes"
         

def modelAnswer():
   tmp=1
def main():
   w = list(input())
   print(myAnswer(w))

if __name__ == '__main__':
   main()

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

c = Counter(w)
for k, v in c.items():
    if not v % 2 == 0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
w = input()

W = set(w)

ans ='Yes'
for s in W:
    if w.count(s) % 2 != 0:
        ans = 'No'
        break

print(ans)

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

Solution (Python):
w = input()
import collections
dct = dict(collections.Counter(list(w)))
for val in dct.values():
    if val % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

w = input()
c = collections.Counter(w)
li = []
for value in c.values():
    li.append(value)
for i in range(len(li)):
    if li[i]%2 != 0:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
from collections import Counter
s=input()
d=Counter(s)
da=[i for i in d if d[i]%2==0]
if len(da)==len(set(s)):
  print("Yes")
else:
  print("No")

Solution (Python):
w = input()

d = dict()
ans = 'Yes'

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

for k, v in d.items():
    if v % 2 == 1:
        ans = 'No'
        break

print(ans)

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

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

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

n = int(0)

for i in w:
    if w.count(i) % 2 == 1:
        n += 1

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

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

Solution (Python):
w = input()

cnt = {chr(i): 0 for i in range(97, 97 + 26)}
for _w in w:
    cnt[_w] += 1

ans = True
for v in cnt.values():
    if v % 2 != 0:
        ans = False
        break

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

Solution (Python):
s = input()
cnt = {}
for x in s:
    if x not in cnt:cnt[x] = 1
    else:cnt[x] +=1
ok = True
for key in cnt:
    if cnt[key] %2 !=0:
        ok = False
        break
if ok:print('Yes')
else:print('No')

Solution (Python):

w = list(input())
t = w.copy()
t = set(t)
t = list(t)

flg = True

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

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

Solution (Python):
s = input()

cnt = {}

for l in s :
    cnt.setdefault(l,0)
    cnt[l] += 1


flag = True
for v in cnt.values():
    if v % 2 == 1:
        flag = False
        break
        
if flag :
    print('Yes')
else :
    print('No')

Solution (Python):
def main():
    w = input()
    alphabet = set(w)

    is_beautiful = True

    for c in alphabet:
        if w.count(c) %2 != 0:
            is_beautiful = False
            break
    
    if is_beautiful:
        print("Yes")
    else:
        print("No")
main()

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

Solution (Python):
w = input()
dicts = {i:0 for i in range(ord('a'), ord('z') + 1)}

for i in w:
    dicts[ord(i)] += 1

print('Yes' if len(list(filter(lambda x:x[1]%2==0, dicts.items()))) == 26 else 'No')

Solution (Python):

import collections


def solve(s):
    counts = collections.Counter(s)

    for key, count in counts.items():
        if count & 1:
            return False

    return True


string = input().strip()

print("Yes" if solve(string) else "No")

Solution (Python):
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = list(iss())
    print('Yes' if all([N.count(n) % 2 == 0 for n in set(N)]) else 'No')


if __name__ == '__main__':
    main()

Solution (Python):
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = list(iss())
    for n in range(ord('a'), ord('z')+1):
        if N.count(chr(n)) % 2 != 0:
            print('No')
            exit()
    else:
        print('Yes')


if __name__ == '__main__':
    main()

Solution (Python):
w=input()
cnt=0
for i in range(len(w)):
  if w.count(w[i])%2==0:
    cnt+=1
    continue
  else:
    cnt=0

if cnt==len(w):
  print("Yes")
else:
  print("No")

Solution (Python):
import collections
w = str(input())
a = collections.Counter(w)
fr = 0
for k,v in a.items():
    if v % 2 == 1:
        fr += 1
if fr == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
w = input()
char = []
for w0 in w:
    if w0 not in char:
        char.append(w0)
    else:
        char.remove(w0)
if len(char) == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter as co
l=co(input()).values()
s={i%2 for i in l}
if 1 in s:print("No")
else:print("Yes")

Solution (Python):
s=input()

s= list(s)
    
import collections

c = collections.Counter(s)

score_sorted = sorted(c.items(), key=lambda x:-x[1])

for k,i in score_sorted:
    if i%2 != 0:
       print('No')
       exit()
print('Yes')

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

for char in set_w:
    count_char = w.count(char)
    if count_char % 2 == 1:
        ans = "No"
    else:
        ans="Yes"
print(ans)

Solution (Python):
w = list(input())
set_w = set(w)
ans = "Yes"

for char in set_w:
    count_char = w.count(char)
    if count_char % 2 == 1:
        ans = "No"
        break
print(ans)

Solution (Python):
s = input()
ss = set(s)
a = set()
for i in ss:
    a.add(s.count(i) % 2 == 0)
if a == {True}:
    print('Yes')
else:
    print('No')

Solution (Python):
import collections
import sys 

s = input()

c = collections.Counter(s)

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

Solution (Python):
import collections
w = str(input())
l = list()
for s in w:
    l.append(s)

c = collections.Counter(l)
for i in range(len(c)):
    s=c.most_common()[i]
    if s[1]%2!=0:
        print('No')
        exit()

print('Yes')

Solution (Python):
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()

"""========main code==============="""

d=defaultdict(int)
s=list(ip())
for i in s:
    d[i]+=1
f=0
for i in set(s):
    if(d[i]%2):
        f=1
        break
if f:
    print("No")
else:
    print("Yes")

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

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

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

ans=0
while w:
    count=1
    check=w.pop()
    while check in w:
        count+=1
        w.pop()
    if count%2==1:
        ans+=1
        
if ans==0:
    print("Yes")
else:
    print("No")

Solution (Python):
import string
import sys

input = sys.stdin.readline
AL = string.ascii_lowercase


def main():
    w = input().rstrip()
    ans = "Yes"
    for s in AL:
        cnt = w.count(s)
        if cnt % 2 == 1:
            ans = "No"
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
w=list(input())
w.sort()
tmp=w[0]
cnt=1
flag=0
if len(w)%2==1:
    print("No")
    exit()
for i in range(1,len(w)):
    if tmp==w[i]:
        cnt+=1
    else:
        if cnt%2==0:
            tmp=w[i]
            cnt=1
        else:
            flag=1
            print("No")
            break
if flag==0:
    print("Yes")

Solution (Python):
S = input()
ec = 0
c = {}
for each in S:
    try:
        c[each] += 1
        if c[each] % 2 == 0:
            ec -= 1
        else:
            ec += 1
    except:
        c[each] = 1
        ec += 1
if (ec == 0):
    print("Yes")
else:
    print("No")

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

Solution (Python):
import collections
w = input()
c = collections.Counter(w)
c = dict(c)

ans='Yes'
for _, v in c.items():
    if v%2==0:
        continue
    else:
        ans='No'
        break
print(ans)

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