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):
def solve(str):
  alphabet_count = [0]*26
  for s in str:
    idx = ord(s) - ord('a')
    alphabet_count[idx] += 1
  for i in alphabet_count:
    if i % 2 != 0:
      return False
  return True

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

Solution (Python):

import sys
input = sys.stdin.readline

from collections import Counter









W = input().rstrip()

C = Counter(W).most_common()

ans = "Yes"
for _,cnt in C:
    if cnt%2 == 1:
        ans = "No"
        break

print(ans)

Solution (Python):
x = input()
s = set(x)
ans = 'Yes'

for c in s:
    if x.count(c) % 2 != 0:
        ans = 'No'
        break

print(ans)

Solution (Python):

w = input()
judgement = 'Yes'
for c in w:
    if w.count(c) % 2 == 1:
        judgement = 'No'
        break
print(judgement)

Solution (Python):
w = input()
cnt = 0
for i in w:
    if (w.count(i) % 2 != 0):
        cnt += 1

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

Solution (Python):

w=input()

import collections 

l=collections.Counter(list(w))
l=list(l.values())

flg=0
for i in range(len(l)):
    if l[i]%2!=0:
        flg+=1

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

Solution (Python):
from collections import Counter

w = Counter(input())
result = 'Yes'

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

print(result)

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

Solution (Python):
s=list(input())
b=1
var = list(set(s))

for i in var:
  if s.count(i)%2==0:
    pass
  else:
    b=0
    
if b:
  print('Yes')
else:
  print('No')

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

Solution (Python):
url = "https://atcoder.jp/contests/abc044/tasks/abc044_b"

def main():
    param = list(input())
    count_d = {}
    for p in param:
        count_d.setdefault(p, 0)
        count_d[p] += 1

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


if __name__ == '__main__':
    main()

Solution (Python):
url = "https://atcoder.jp/contests/abc044/tasks/abc044_b"

def main():
    param = list(input())
    count_d = {}
    for p in param:
        count_d.setdefault(p, 0)
        count_d[p] += 1

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


if __name__ == '__main__':
    main()

Solution (Python):
from sys import exit

w = list(input())

w_set = list(set(w))

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

Solution (Python):
url = "https://atcoder.jp/contests/abc044/tasks/abc044_b"

def main():
    param = list(input())
    count_d = {}
    for p in param:
        count_d.setdefault(p, 0)
        count_d[p] += 1

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


if __name__ == '__main__':
    main()

Solution (Python):
li = list(input())
li.sort()
while True:
    if len(li) == 0:
        print("Yes")
        break
    elif not len(li) % 2 == 0:
        print("No")
        break
    elif li[0] == li[1]:
        li.pop(0)
        li.pop(0)
    else:
        print("No")
        break

Solution (Python):
li=list(input())
li.sort()
if len(li)%2:
    print("No")
    exit()
while True:   
    if len(li)==0:
        print("Yes")
        break
    elif li[0]==li[1]:
        li.pop(0)
        li.pop(0)
    else:
        print("No")
        break

Solution (Python):
li=list(input())
li.sort()
if len(li)%2:
    print("No")
    exit()
while True:   
    if len(li)==0:
        print("Yes")
        break
    elif li[0]==li[1]:
        li.pop(0)
        li.pop(0)
    else:
        print("No")
        break

Solution (Python):
li = list(input())
flag=1
for a in li:
    if li.count(a)%2:
        print("No")
        flag=0
        break
if flag:
    print("Yes")

Solution (Python):
li = list(input())
flag=1
for a in li:
    if li.count(a)%2:
        print("No")
        flag=0
        break
if flag:
    print("Yes")

Solution (Python):
w=sorted(list(input()))+["_"];s="Yes" 
for i in range(1,len(w),2):
    if w[i]!=w[i-1]:s="No"
print(s)

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

Solution (Python):
w = list(map(str, input()))
ans = 'Yes'
for i in (set(w)):
    if w.count(i)%2!=0: ans ='No'
print(ans)

Solution (Python):
l = list(input())
for i in range(97,123):
  x = chr(i)
  if l.count(x) % 2 != 0:
    print("No")
    exit()
print("Yes")

Solution (Python):




"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""





def main():
  w = input()
  dic = {}
  for i in range(len(w)):
    if w[i] in dic:
      dic[w[i]] +=1
    else:
      dic[w[i]] = 1
  for k,v in dic.items():
    if v % 2 != 0:
      print('No')
      exit()
  print('Yes')
if __name__ == '__main__':
  main()

Solution (Python):
import sys

s=input()

for i in range(len(s)):
  if s.count(s[i])%2==0:
    pass
  else:
    print("No")
    sys.exit()
    
print("Yes")

Solution (Python):
from collections import Counter

w = list(input())

w = Counter(w)

for k,v in w.items():
    if v%2!=0:
        print("No")
        exit()

print("Yes")

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

for x in c.values():
  if x%2 == 1:
    print("No")
    break
  else:
    continue
else:
  print("Yes")

Solution (Python):

import math
import itertools
import statistics

import collections



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

print("Yes")

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
from decimal import *


def lcm(x, y):
    return (x * y) // math.gcd(x, y)


if __name__ == '__main__':
    s = input()
    ans ={}
    for i in s:
        if i in ans:
            ans[i] +=1
        else:
            ans[i] =1
    flg =0

    for i in ans.values():
        if i % 2 >0:
            flg =1
            break
    if flg == 0:
        print("Yes")
    else:
        print("No")

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

Solution (Python):
w = list(map(str,input()))

w_ord = []

for i in range(len(w)):
    w_ord.append(ord(w[i]))

w_ord.sort()

j = 1

if len(w) % 2 == 1:
    print("No")
else:
    for i in range((len(w)+1)//2):
        if not w_ord[2*i] == w_ord[2*i + 1]:
            print("No")
            break
        else:
            if i == (len(w)+1)//2 -1:
                print("Yes")

Solution (Python):
w = input()
count = {}
for s in w:
    try:
        count[s] += 1
    except:
        count[s] = 1
for s in count.values():
    if s&1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):

w = list(input())

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

print("Yes")

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

c = [0] * 26

for ch in w:
    c[ord(ch) - ord("a")] += 1

f = "Yes"
for cnt in c:
    if cnt % 2 == 1:
        f = "No"

print(f)

Solution (Python):
strlist = list(input())
findlist="qazwsxedcrfvtgbyhnujmikolp"
flist=list(findlist)
flag = "Yes"
for a in flist:
    if strlist.count(a) % 2:
        flag = "No"
print(flag)

Solution (Python):
strlist = list(input())
findlist="qazwsxedcrfvtgbyhnujmikolp"
flist=list(findlist)
flag = "Yes"
for a in flist:
    if strlist.count(a) % 2:
        flag = "No"
print(flag)

Solution (Python):
strlist = list(input())
findlist="qazwsxedcrfvtgbyhnujmikolp"
flist=list(findlist)
flag = "Yes"
for a in flist:
    if not strlist.count(a) % 2 == 0:
        flag = "No"
print(flag)

Solution (Python):
w=input()

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

print("Yes")

Solution (Python):
import numpy as np
w=list(input())
k=[]
for i in range(97,97+26):
    k.append(w.count(chr(i)))
k1=np.mod(k,2)
if 1 in k1:print('No')
else:print('Yes')

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

Solution (Python):
s = list(input())
aqui = []

for l in s:
	if l not in aqui:
		aqui.append(l)
		continue
	aqui.remove(l)

print('Yes') if len(aqui) == 0 else print('No')

Solution (Python):
w = str(input())
check = int(0)
c = int(0)

for a in [chr(i) for i in range(97,97+26)]:
  c = w.count(a)

  if(c%2 == 1):
    check = check + 1

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

Solution (Python):
w = input()
alp = 'abcdefghijklmnopqrstuvwxyz'
c = []
for i in range(26):
    a = w.count(alp[i])
    c.append(a)
d = 0
for i in range(26):
    if c[i] % 2 == 0:
        d = 1
    else:
        d = 0
        break
if d == 0:
    print('No')
else:
    print('Yes')

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

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

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

Solution (Python):
w=list(input())
for i in w:
    count=0
    for j in w:
        if i==j:
            count+=1
    if not count%2==0:
        print("No")
        break
if count%2==0:
    print("Yes")

Solution (Python):
"""

kari1 = 'hthth' 
in1 = kari1
"""
in1 = input()

mydict = {}

idx1 = 0
for idx1 in range(len(in1)):
    if in1[idx1] in mydict.keys():
        mydict[in1[idx1]] += 1
    else:
        mydict[in1[idx1]] = 1

RC = 'Yes'
for item in mydict.values():
    if item % 2 == 1:
        RC = 'No'
        break

print(RC)

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

ans = "Yes"

W = Counter(w)

for x in W.values():
    if x % 2 != 0:
        ans = "No"
        break

print(ans)

Solution (Python):
w = input()

import collections

W = collections.Counter(list(w))

liW = list(W.values())
flag = True
for i in range(len(liW)):
  if (liW[i]/2)%1 != 0:
    flag = False

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

Solution (Python):
w = input()

dict = {key:0 for key in set(w)}
for i in w:
    dict[i] += 1
ok = True
for i in dict.values():
    if i % 2 != 0:
        ok = False
if ok:
    print("Yes")
else:
    print("No")

Solution (Python):


from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key



__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


def lcm(a, b):
    return (a*b) // gcd(a,b)

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x



if __name__ == '__main__':
    w = input()

    bucket = [0] * 26
    A = ord('a')
    for c in w:
        i = ord(c) - A
        bucket[i] += 1
    judge = True
    for b in bucket:
        if b&1:
            judge = False
            break

    
    print(yn[not judge::2])

Solution (Python):
from collections import Counter
w=list(input())
c=Counter(w)
for i,m in c.items():
    if m%2!=0:
        print("No")
        exit()
print("Yes")

Solution (Python):
w = input()


d = {chr(i): 50 for i in range(97, 97+26)}

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

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

print(ans)

Solution (Python):
import collections

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

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

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

Solution (Python):
def problemB():
    """ B - 美しい文字列 """
    w = input()
    while True:
        if len(w) == 0:
            ans = 'Yes'
            break

        find = w[0]
        cnt = w.count(find)
        if cnt % 2 == 1:
            ans = 'No'
            break

        w = w.replace(find, '')

    print(ans)


if __name__ == '__main__':
    problemB()

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

Solution (Python):
w = input()
evenCount = 0

for i in range(len(w)):
    if w.count(w[i]) % 2 == 0:
        evenCount += 1

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

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

Solution (Python):
import collections

s = input()
cnt = collections.Counter()

for i in s:
    cnt[i] += 1


if all([True if i % 2 == 0 else False for i in cnt.values()]):
    print("Yes")
else:
    print("No")

Solution (Python):
w=input()

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

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

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

Solution (Python):
from collections import Counter

w=list(input())
W=list(Counter(w).values())
flag=0

for i in W:
    if i%2==0:
        flag=1
    else:
        flag=0
        break
        
print("Yes" if flag else "No")

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

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

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

Solution (Python):
s=input()
counts={chr(code): 0 for code in range(ord('a'), ord('z') + 1)}
for i in s:
  counts[i]+=1
for v in counts.values():
  if v%2==1:
    print('No')
    exit()
print('Yes')

Solution (Python):
import sys

ss=input()
d={}
for s in ss:
  if s in d.keys():
    d[s]+=1
  else:
    d[s]=1

for k in d.keys():
  if d[k]%2!=0:
    print("No")
    sys.exit()
print("Yes")

Solution (Python):

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    w=input()
    from collections import defaultdict
    dd = defaultdict(int)
    
    for i in range(len(w)):
        dd[w[i]]+=1
        
        
    f=1
    for k,v in dd.items():
        if v%2==1:
            f=0
            
    if f==1:
        print("Yes")
    else:
        print("No")

main()

Solution (Python):
n = input()
flag = True
for str in n:
	if n.count(str)%2!=0:
		flag = False
		break

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

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

ans = "Yes"
for r in cnt.values():
    if r % 2 == 0:
        continue
    ans = "No"
    break

print(ans)

Solution (Python):
w = input()
d = {c: w.count(c) for c in w}
print("Yes" if all(d[k] % 2 == 0 for k in d) else "No")

Solution (Python):

w = input()

l = [chr(i) for i in range(97, 97+26)]
bool = True
for v in l:
    if w.count(v)%2 == 1:
        bool = False
        break
        
print('Yes' if bool else 'No')

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

cnt = 0
for i in L:
    if L.count(i) % 2 == 1:
        cnt += 1
        break
print('Yes' if cnt == 0 else 'No')

Solution (Python):
w = input()
A = []
a1 = []
a2 = []

if len(w) % 2 == 0:
    for i in range(len(w)):
        A.append(w[i])

    A.sort()
    for i in range(len(w)):
        if i % 2 == 0:
            a1.append(A[i])
        else:
            a2.append(A[i])

    if a1 == a2:
        print("Yes")
    else:
        print("No")

else:
    print("No")

Solution (Python):

w = input()
L = list(w)

cnt = 0
for i in L:
    if L.count(i)%2==1:
        cnt += 1
if cnt ==0:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):
s = input()

counter = [0] * 26

for i in s:
    counter[ord(i)-97] += 1

flag = 'Yes'
for i in counter:
    if (i % 2) == 1:
        flag = 'No'

print(flag)

Solution (Python):
def main():
    w = input()
    t = [0] * 123

    for s in w:
        t[ord(s)] += 1

    for i in t[97:]:
        if i & 1:
            print('No')
            return

    print('Yes')

main()

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

Solution (Python):








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

Solution (Python):
w = input()
w_list = [ord(num) for num in list(w)]

for i in range(97,123):
    if w_list.count(i)%2 == 1:
        print("No")
        exit()
print("Yes")

Solution (Python):
w = input()
a =list(w)
cnt = 0
for i in a:
    if a.count(i) % 2 != 0:
        cnt += 1

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

Solution (Python):
def main():
    W = list(input())

    W.sort()

    for w in W:
        if W.count(w) % 2 != 0:
            print("No")
            return
        else:
            del W[: W.count(w)]

    print("Yes")


if __name__ == "__main__":
    main()

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

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

s = readline().rstrip().decode('utf-8')

c = Counter(s)

for i,j in c.items():
    if j%2!=0:
        print("No")
        exit()
print("Yes")

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

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

else:
            c=collections.Counter(l)
            c_item=list(c.values())
            for i in range(len(set(l))):
                         if c_item[i] %2 !=0:
                                    print('No')
                                    exit()
print('Yes')

Solution (Python):
import collections
w = input()
W = list(w)
S = collections.Counter(W)
a = list(S.values())
n = 0
for i in range(len(a)):
    if (a[i] % 2) ==1:
        n = n + 1
if n == 0:
    print("Yes") 
else:
    print("No")

Solution (Python):
a=input()
list=list(a)
length=len(list)
count=0
for k in range(length):
  if list.count(list[k])%2==0:
    count+=1
    if count==length:
      print("Yes")
      break
    else:
      continue
  else:
    print("No")
    break

Solution (Python):
s = input()

def isBeautiful(s):
  dict = {}
  for i in s:
    if i not in dict:
      dict[i] = 1
    else:
      dict[i] += 1
      
  for key in dict:
    if dict[key] % 2 != 0:
      return "No"
    
  return "Yes"
  
print(isBeautiful(s))

Solution (Python):
import re
w = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'

for item in alphabet:
    pattern = item
    if len(re.findall(pattern, w))%2 == 1:
        print('No')
        exit()
print('Yes')

Solution (Python):
w=input()
letters_dict={}
for n in range(0,len(w)):
    letter=w[n]
    if letter in letters_dict:
        letters_dict[letter]+=1
    else:
        letters_dict[letter]=1
for n in range(0,len(letters_dict)):
    if list(letters_dict.values())[n]%2==1:
        print("No")
        break
else:
    print("Yes")

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

s = "Yes"
while(s == "Yes"):
  for t in c.most_common():
    if (t[1]%2) != 0:
      s = "No"
  break
print(s)

Solution (Python):
S=input()
import collections
array=[]
for i in range(len(S)):
    array.append(S[i])
c=collections.Counter(array)
e=[chr(i) for i in range(97, 97+26)]
for j in range(len(e)):
    if not c[e[j]]%2==0:
        print('No')
        exit()
print('Yes')

Solution (Python):
w = input()
dic = {}
for i in w:
    if i not in dic.keys():
        dic[i] = 1
    else:
        dic[i] += 1
for i in dic.values():
    if i % 2 != 0:
        print('No')
        exit()
print('Yes')

Solution (Python):
import sys
from collections import Counter

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7


w = input()
counter = Counter(w)
for c, num in counter.items():
    if num % 2 != 0:
        print('No')
        exit(0)
print('Yes')

Solution (Python):
s=input()
li=[i for i in s]
p="abcdefghijklmnopqrstuvwxyz"
for i in p:
    if li.count(i)%2==1:
        print("No")
        exit()
else:
    print("Yes")

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

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

Solution (Python):
w = input()
ans = 'No'

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

print(ans)

Solution (Python):
li = [0]*26
alpha2num = lambda c: ord(c) - ord('A')
w = input().upper()
for i in range(len(w)):
  k = alpha2num(w[i])
  li[k] += 1
for j in li:
  if j % 2:
    print("No")
    break
else:
  print("Yes")

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

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

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

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

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

Solution (Python):
from collections import Counter
w = input()
C = Counter(w)
for e in C:
    if C[e]%2 != 0:
        print("No")
        exit(0)
print("Yes")

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

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

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

print ("Yes")

Solution (Python):
w = input()

hash = {}

for x in range(len(w)):
    hash[w[x]] = 0

for x in range(len(w)):
    hash[w[x]] += 1

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

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

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

Solution (Python):
l = input()
L = list(l)
k = 0
for i in range(26):
  m = chr(ord('a')+i)
  if L.count(m) % 2 == 1:
    k = 1
    break
if k == 0:
  print("Yes")
else:
  print("No")

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

Solution (Python):
text=input()
dic={}
for i in range(len(text)):
    if text[i] not in dic:
        dic[text[i]]=1
    else:
        dic[text[i]]+=1     
for i in dic.values():
    if i%2!=0:
        print('No')
        exit()
        
print('Yes')

Solution (Python):

s=input()
moji=dict()
flag=True
for i in s:
    if i not in moji:
        moji[i]=1
    else:
        moji[i]+=1

for i in moji.values():
    if i%2==1:
        flag=False
        break
print("Yes" if flag else "No")

Solution (Python):

w = list(str(input()))
n = len(w)
alph = ['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']

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

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

if n%2!= 0:
    print('No')
else:
    x,y=[],[]
    for i in range(int(n/2-1)):
        x.append(w[2*i])
        y.append(w[2*i+1])
    print('Yes') if x==y else print('No')

Solution (Python):
w = input()

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

Solution (Python):
w = input()
a = "abcdefghijklmnopqrstuvwxyz"
co = 0
ch = True
for i in a:
    for j in w:
        if i == j:
            co += 1
    if co % 2:
        ch = False
        break
    co = 0
    
    
if ch:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()
arr = set(w)
dw = {i:0 for i in arr}
for i in w:
    dw[i]+=1
temp = 0
for i in arr:
    temp += dw[i]%2
print('Yes' if temp==0 else 'No')

Solution (Python):
import collections
w=input()
words=[a for a in w]
c=collections.Counter(words)
values,counts=zip(*c.most_common())
count=0
for n in counts:
    if n%2==1:
        print('No')
        break
    else:
        count+=1
        continue

if count==len(values):
    print('Yes')
else:
    pass

Solution (Python):
w = input()

d = {}

for i in range(len(w)):
  if not(w[i] in d):
    d.setdefault(w[i], 1)
    
  elif w[i] in d :
    d[str(w[i])] += 1
    
c = 0
for i in d.values():
  if i % 2 ==0:
    c +=1
    

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

Solution (Python):

import sys
sys.setrecursionlimit(10**8)
from collections import defaultdict
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


def solve(w: str):
    d = defaultdict(int)
    for c in w:
        d[c] += 1
    flag = True
    for k, v in d.items():
        if v % 2 == 1:
            flag = False
            break
    if flag:
        yes()
    else:
        no()

    return


def main():

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


if __name__ == '__main__':
    main()

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

Solution (Python):
list = {'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'}
str = input()
ans = 'Yes'
for alpha in list:
  cnt = str.count(alpha)
  if cnt % 2 == 1:
    ans = 'No'
    break
    
print(ans)

Solution (Python):


w = input()

w_dic = {}

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

ans = [k for k, v in w_dic.items() if v % 2 != 0]

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

Solution (Python):
def count_dict(mystring):
    d = {}

    for w in mystring: 
        d[w] = mystring.count(w)
    return d
    
w = str(input())

values = count_dict(w).values()

valmod2 = [int(i%2) for i in values]

if all(val ==0 for val in valmod2):
    print('Yes')
    
else:
    print('No')

Solution (Python):

w=input()
flg=all(w.count(chr(i))%2==0 for i in range(ord('a'),ord('z')))
print('Yes' if flg else 'No')

Solution (Python):
w = input()

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

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

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

Solution (Python):
w = list(input())
tmp = [w.count(a) %2 for a in 'abcdefghijklmnopqrstuvwxyz']
print('No') if 1 in tmp else print('Yes')

Solution (Python):


s = input().strip()

W_dic={ w:0 for w in s }

for w in s:
    W_dic[w] += 1

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