Problem:
 Score : 200 points    Problem Statement Let w be a string consisting of lowercase letters.
We will call w  beautiful if the following condition is satisfied:   Each lowercase letter of the English alphabet occurs even number of times in w .   You are given the string w . Determine if w is beautiful.      Constraints  1 \leq |w| \leq 100  w consists of lowercase letters ( a - z ).         Input The input is given from Standard Input in the following format:  w       Output Print Yes if w is beautiful. Print No otherwise.        Sample Input 1 abaccaba      Sample Output 1 Yes  a occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.       Sample Input 2 hthth      Sample Output 2 No

Solution (Python):
w=input()
l=[]
c=0
for i in w:
  l.append(i)
l.sort()
if len(l)<2:
  print('No')
  exit()
for k in range(len(l)-1):
  if l[k]==l[k+1]:
    c+=1
  elif c%2==1:
    c=0
    continue
  else:
    print('No')
    exit()
print('Yes')

Solution (Python):
w = input()
count = {}
for i in w:
    count.setdefault(i, 0)
    count[i] += 1
flag = True
for i in count.values():
    if i % 2 == 1:
        flag = False
        break
if flag == True:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
import re
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

w = input()
eimozi = "abcdefghijklmnopqrstuvwxyz"
flag = True
for i in eimozi:
    flag = w.count(i) % 2 == 0
    if (not flag):
        break
print("Yes" if flag else "No")

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

if len(x) % 2:
  print('No')

else:
  f = True
  for i in range(0, len(x), 2):
    if x[i] == x[i + 1]:
      continue
    else:
      f = False
      break
  
  print('Yes' if f else 'No')

Solution (Python):
a = input()
ans = "Yes"

char_list = list(a)
doubli = list(set(char_list))


for x in doubli:
    
    if(char_list.count(x) % 2 == 1):
        ans = "No"
        break
print(ans)

Solution (Python):
import sys
W = input()
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"]
for num in alpha:
    if W.count(num) %2 != 0:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
import numpy as np
import sys
w = input()
countn = np.zeros(26)
ew = "abcdefghijklmnopqrstuvwxyz"
i = 0
while i < 26:
    countn[i] = w.count(ew[i])
    if countn[i] %2 != 0:
        print("No")
        sys.exit()
    i +=1
  
print("Yes")

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

Solution (Python):
w = str(input())
letter = ['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']
A = 'Yes'
for letter in letter:
  if w.count(letter)%2 != 0:
    A = 'No'
    break
print(A)

Solution (Python):

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

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

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

w_dict = {}
for i in range(len(w)):
    if w[i] not in w_dict:
        w_dict[w[i]] = True

isBeautiful = True

for k,v in w_dict.items():
    idx = w.index(k)
    if idx % 2 != 0:
        isBeautiful = False

if len(w_dict.items()) == 1:
    if len(w) % 2 != 0:
        isBeautiful = False

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    n = II()
    k = II()
    x = II()
    y = II()
    ans = 0
    for i in range(n):
        if i >= k:
            ans += y
        else:
            ans += x
    print(ans)
    return


def B():
    w = S()
    d = defaultdict(int)
    for s in w:
        d[s] += 1
    for di in d.values():
        if di % 2:
            print("No")
            return
    print("Yes")
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    B()

Solution (Python):
W = input()
counters = []
for i in range(0, 26):
	counters.append(0)
for i in range(0, len(W)):
	counters[ord(W[i])-97] += 1
ans = 'Yes'
for i in range(0, 26):
	if counters[i]%2 == 1:
		ans = 'No'
		break
print(ans)

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

tmp = []
cnt = []
for l in w:
    if l not in tmp:
        tmp.append(l)
        cnt.append(1) 
    else:
        cnt[-1] += 1
flag = 0
for x in cnt:
    if x%2 != 0:
        flag = 1
        break
    else:
        pass
if flag == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
flag = "Yes"

for x in s:
    if s.count(x) % 2 != 0:
        flag = "No"

print(flag)

Solution (Python):
w = input()

counts = dict()

for c in w:
  counts[c] = counts.get(c, 0) + 1

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

print("Yes")

Solution (Python):

w = input()

dic = {}


for i in w:

    if i in dic:
        dic[i] += 1

    else:
        dic[i] = 1


ans = "Yes"

for i in dic:

    if dic[i] % 2 == 1:
        ans = "No"
        break

print (ans)

Solution (Python):
W = input()

D = {}

flag = 0

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


for v in D.values():
    if v % 2 == 1:
        flag = 1
        continue
    else:
        pass

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

Solution (Python):
S = input()
ss = set(list(S))
flag = True
for w in ss:
    if(S.count(w) % 2 == 1):
        flag = False

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

Solution (Python):
l='abcdefghijklmnopqrstuvwxyz'
w=input()
print('YNeos'[sum([w.count(x)%2 for x in l])!=0::2])

Solution (Python):
s=list(input())
flag="Yes"
for v in s:
    if s.count(v)%2!=0:
        flag="No"
print(flag)

Solution (Python):
from collections import Counter

w = list(input())
if len(w) % 2 == 1:
    print('No')
else:
    res = [0 if e % 2 == 0 else 1 for e in Counter(w).values()]
    if sum(res) == 0:
        print('Yes')
    else:
        print('No')

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

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

Solution (Python):
from sys import stdin
import string
w = (stdin.readline().rstrip())
flag = True
for i in string.ascii_lowercase:
    if w.count(i) % 2 != 0:
        flag = False
if flag:
    print("Yes")
else:
    print("No")

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

Solution (Python):
a = input()
b = {}
for i in range(len(a)):
    if a[i] in b:
        b[a[i]] += 1
    else:
        b[a[i]] = 1
for i in b:
    if b[i] % 2 != 0:
        print("No")
        exit()
print("Yes")

Solution (Python):
import collections as c
a = c.Counter(input())
b = a.values()
c = [i for i in b if i % 2]
if len(c) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
input = input()
import string
al = string.ascii_lowercase
for a in al:
    tmp = ""
    for i in input:
        if i==a:
            tmp+=i
    if(len(tmp)%2 == 1):
        print("No")
        exit()
print("Yes")

Solution (Python):
s = input()
for it in range(ord('a'), ord('z') + 1):
  ch = chr(it)
  if s.count(ch) % 2:
    print("No")
    exit(0)
print("Yes")

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

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

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

Solution (Python):
w = input()

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

Solution (Python):
w = input()
word = {}
l = len(w)

for i in range(l):
    n = word.get(w[i], 0)
    n = n+1
    word[w[i]] = n

flag = True
for i in word.values():
    if(i % 2 == 1):
        flag = False
        break

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

Solution (Python):
s = list(input())
ans = {x: s.count(x) for x in s}
answer =[]
for k, v in ans.items():
  answer.append(v)
for i in range(len(answer)):
  if answer[i] % 2 != 0:
    print('No')
    exit()
print("Yes")

Solution (Python):
w = input()

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

Solution (Python):



w = input()

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

Solution (Python):
import collections
l=list(str(input()))
c = collections.Counter(l)
values, counts = zip(*c.most_common())
if all([i%2==0 for i in counts]):
    print("Yes")
else:print("No")

Solution (Python):
w=input()
count={chr(i):0 for i in range(97,97+26)}
for c in w:
    count[c]+=1
flag=0
for i in range(97,97+26):
    if count[chr(i)]%2!=0:
        flag=1
print(['Yes','No'][flag])

Solution (Python):
w = list(input())
w.sort()
r = 1
for i in range(len(w)):
	if i!=(len(w)-1) and i%2==0 and w[i]!=w[i+1]:	r=0
if(i!=0):
	if(w[i]!=w[i-1]):	r=0
if(i==0):
	r=0
if r:	print("Yes")
else:	print("No")

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

Solution (Python):
from collections import Counter
x = Counter(input()).values()
a = 0
for i in x:
    if i%2==1:
        a = 1

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

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

Solution (Python):
import sys
s = input()
ans = {}
for i in s:
  if i in ans:
    ans[i] +=1
  else:
    ans[i] = 1
for i in ans.values():
  if i%2!=0:
    print('No')
    sys.exit()
print('Yes')

Solution (Python):
s = list(input())
a = "".join(s)
flag = 0
for v in s:
  if(a.count(v)%2==1):
    flag=1

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

Solution (Python):
s = list(input())
a = "".join(s)
flag = 0
for v in s:
  if(a.count(v)%2==1):
    flag=1

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

Solution (Python):
w = input()
lst = list(w)
lst_set = set(lst)
for t in lst_set:
    num = lst.count(t)
    if num%2!=0:
        print('No')
        exit()
print('Yes')

Solution (Python):
from collections import Counter
s = input()
ans = Counter(s).most_common()
ans = all(map(lambda x: x[1] % 2 == 0, ans))
print("Yes" if ans else "No")

Solution (Python):
from collections import Counter as c
w=input()
l=list(c(w).values())
x='Yes'
for i in range(len(l)):
  if l[i]%2!=0:
    x='No'
    break
print(x)

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

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

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

Solution (Python):
from collections import Counter
a = input()
b = Counter(a)
c = 0

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

Solution (Python):
w = input()

ans = 'Yes'

for ch in w:
    if w.count(ch)%2:
        ans = 'No'
        break

print(ans)

Solution (Python):
w = input()
p = [0] * 256
for i in w:
    p[ord(i)] += 1
ans = "Yes"
for i in range(256):
    if p[i] % 2:
        ans = "No"
print(ans)

Solution (Python):
import os
import sys
from collections import Counter

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

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18

W = sys.stdin.readline().rstrip()

if any([w % 2 for w in Counter(list(W)).values()]):
    print('No')
else:
    print('Yes')

Solution (Python):
import bisect
import heapq
import itertools
import math
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter

import numpy as np

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

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18

W = sys.stdin.readline().rstrip()

if any([w % 2 for w in Counter(list(W)).values()]):
    print('No')
else:
    print('Yes')

Solution (Python):
import bisect
import heapq
import itertools
import math
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter

import numpy as np

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

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18

W = sys.stdin.readline().rstrip()

if any([w % 2 for w in Counter(list(W)).values()]):
    print('No')
else:
    print('Yes')

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

Solution (Python):
w = input()
s = set([i for i in w])

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

Solution (Python):
def main():
    word=input()
    for i in word:
        if word.count(i)%2!=0:
            print("No")
            return 
    print("Yes")
if __name__ == "__main__":
    main()

Solution (Python):
def main():
    word = list(input())
    word_set = list(set(word))
    

    for str in word_set:
        if word.count(str) % 2 == 1:
            print('No')
            return

    
    
    
    

    print('Yes')


if __name__ == "__main__":

    main()

Solution (Python):
def main():
    word = input()

    for str in word:
        if word.count(str) % 2 == 1:
            print('No')
            return

    print('Yes')


if __name__ == "__main__":

    main()

Solution (Python):
def main():
    l = list(input())
    l_set = list(set(l))
    for i in l_set:
        n = l.count(i)
        if n%2 != 0:
            return 'No'

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

Solution (Python):


import collections

w = input()
arr = list(w)
dic = collections.Counter(arr)
for i in dic.values():
    if i % 2 != 0:
        print("No")
        break
else:
    print("Yes")

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

w_dict = {}
for c in w_list:
    if( c not in w_dict ):
        w_dict[c] = 1
    else:
        w_dict[c] += 1

result = 'Yes'
for v in w_dict.values():
    if( v % 2 ):
        result = 'No'

print(result)

Solution (Python):
w = str(input())
alp =[]
judge = "True"
for i in w:
    if i not in alp:
        alp.append(i)
for x in alp:
    if w.count(x)%2 ==1:
        judge = "False"
if judge == "True":
    print("Yes") 
else:
    print("No")

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

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

letter = 'abcdefghijklmnopqrstuvwxyz'
alphabet_count = [0]*len(letter)

for i in range(len(w_str)):
  for k in range(len(letter)):
    if letter[k] == w_str[i]:
      alphabet_count[k] += 1

count = 0
for j in range(len(alphabet_count)):
  if alphabet_count[j] % 2 == 0:
    count += 1

if count == 26:
  print('Yes')
else:
  print('No')

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

Solution (Python):
w = input()
w_list = list(w)
alpha_list = [0] * 26
alpha_num = 0

alpha_fun = lambda c: ord(c) - ord('a')

for i in w_list:
    alpha_list[alpha_fun(i)] += 1

flg_num = 0
flg = False

for j in alpha_list:
    if j == 0 or j % 2 == 0:
        flg = True
    else:
        flg = False
        break

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

Solution (Python):
from collections import defaultdict

def main():

    W = input()
    d = defaultdict(int)

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

    for v in d.values():
        if v % 2 != 0:
            return 0

    return 1 


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

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

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

print ('Yes')

Solution (Python):
S = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'

for c in alphabet:
    s = S.count(c)
    if s % 2 != 0:
        print('No')
        exit()

print('Yes')

Solution (Python):
S = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'
alpha_list = list(alphabet)

for c in alpha_list:
    s = S.count(c)
    if s % 2 != 0:
        print('No')
        exit()

print('Yes')

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

Solution (Python):
w = input()
l = []
for i in range(len(w)):
	if w[i] not in l:
		l.append(w[i])
cnts = [2] * len(l)
for i in range(len(w)):
	for j in range(len(l)):
		if w[i] == l[j]:
			cnts[j] += 1
			
if all(i%2 == 0 for i in cnts):
	print("Yes")
else:
	print("No")

Solution (Python):
w = input()
a = {}
for i in w:
    a[i] = 1
x = 1
for i in a:
    if (w.count(i) & 1) == 1:
        x = 0
        break
if x:
    print('Yes')
else:
    print('No')

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

W = s()

from collections import defaultdict
counts = defaultdict(int)

for c in W:
    counts[c] += 1

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

Solution (Python):
from sys import exit, stdin
from collections import Counter
s = Counter(stdin.readline().rstrip())
for k, v in s.items():
  if v % 2 != 0:
    print('No')
    exit()
print('Yes')

Solution (Python):
s=input().rstrip()
x=list(s)
G=0;
t=list(set(x))
for i in range(0,len(t)):
    if x.count(t[i])%2==0:
        continue;
    else:
        G=1;
        break;
if G==1:
    print("No")
else:
    print("Yes")

Solution (Python):
w=input()
ans=0
d=[0]*30
for i in w:
    d[ord(i)-ord("a")]+=1
for i in d:
    if i%2: ans=1
print(["Yes","No"][ans])

Solution (Python):
w = input()

flag = True
for s in w:
    if not w.count(s) % 2 == 0:
        flag = False
        break
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter

W = input()
cnt = Counter(W)
for n in cnt.values():
    if n % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys

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

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())

w = str(input())

import collections
c = collections.Counter(w)
for key in c.keys():
    if c[key] % 2 == 0:
        pass
    else:
        break
else:
    print("Yes")
    exit()
print("No")

Solution (Python):
w = input()
S = "abcdefghijklmnopqrstuvwxyz"

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

print("Yes")

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

Solution (Python):

ans = "Yes"

lst_A = list(input())

lst_A.sort()

if len(lst_A) % 2 == 1:
    ans = "No"

else:
    for i in range(0,len(lst_A)-1,2):
        if lst_A[i] != lst_A[i+1]:
            ans = "No"

print(ans)

Solution (Python):
word = input()
judge = []
ans = 0
for i in range(len(word)):
    judge.append(word.count(word[i]))

for i in range(len(judge)):
    if judge[i] %2 == 0:
        ans += 0
    else:
        ans += 1
if ans == 0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
from collections import Counter

W = input()
C = Counter(W)
if all(v % 2 == 0 for v in C.values()):
    print("Yes")
else:
    print("No")

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

Solution (Python):
def abc():
    from itertools import groupby
    s = sorted(input().rstrip())
    for k, g in groupby(s):
        if len(list(g)) % 2:
            print('No')
            return
    print('Yes')


abc()

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

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

Solution (Python):
w = input()
from collections import defaultdict
dic = defaultdict(lambda : 0)
for i in w:
    dic[i] += 1
counter = 0
for key in dic.keys():
    if dic[key] % 2 != 0:
        counter = -1
        break
if counter == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
w = input()
flg = True
for i in list("abcdefghijklmnopqrstuvwxyz"):
    if w.count(i) % 2 != 0:
        flg = False

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

Solution (Python):
w=sorted(input())
if len(w)%2==1:
    print('No')
else:
    while len(w)>=2:
        if w.pop(0)!=w.pop(0):
            print('No')
            exit()
    print('Yes')

Solution (Python):
w = input()

from collections import Counter
C = Counter()
for w_i in w:
  C[w_i]=(C[w_i]+1)%2
if sum(C.values())>0:
  print("No")
else:
  print("Yes")

Solution (Python):
S = input()
counter = []
for i in range(0, 26):
	counter.append(0)
for i in range(0, len(S)):
	counter[ord(S[i])-97] += 1
ans = 'Yes'
for i in range(0, 26):
	if counter[i]%2 != 0:
		ans = 'No'
		break
print(ans)

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

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

for i in range(len(s)):
  if w.count(s[i]) % 2 == 1:
    ans = 'No'
    break

print(ans)

Solution (Python):
from collections import defaultdict

di = defaultdict(lambda :0)
S = input()
for c in S:
    di[c] += 1
flag = True
for v in di.values():
    if v %2 == 1:
        flag = False
        break

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

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

bl = True
for v in c.values():
  if v&1:
    bl = False
    
answer = 'Yes' if bl else 'No'
print(answer)

Solution (Python):
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))


w = C(input())
for cnt in w.values():
    if cnt % 2 == 1:
        print("No")
        exit()
print("Yes")

Solution (Python):


w = input()

ans = 0

w1 = list(set(list(w)))

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

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

Solution (Python):
w = input()

if any(w.count(t)%2 for t in w) == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
W = input()

w_list = {}

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

ans = 'Yes'

for w in w_list:
	if(w_list[w] % 2 != 0):
		ans = 'No'
		break

print(ans)

Solution (Python):
w = input()
W = []
for k in w:
    W.append(k)
for i in W:
    if W.count(i) % 2:
        print('No')
        exit()

print('Yes')

Solution (Python):
string = input()
ans = True
for c in string:
    if string.count(c) % 2 != 0:
        ans = False

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

Solution (Python):

a=list(input())
a.sort()
i=0

while True:
    try:
        z=a[i]
        if a.count(z)%2==0:
            i=i+a.count(z)

        else:
           print("No")
           break
    except:
        print("Yes")
        break

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

Solution (Python):
import sys

str = input()
str = sorted(str)

flag = False
for index, s in enumerate(str):
    if index+1 < len(str) and s == str[index+1]:
        flag ^= True
    else:
        if not flag:
            print("No")
            sys.exit()
        else:
            flag = False

print("Yes")

Solution (Python):
S = input()
C = {c: S.count(c) for c in S}
C = set(C.values())
C = {c % 2 == 0 for c in C}
print('Yes' if all(C) else 'No')

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

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

Solution (Python):
s=input()
answer="Yes"
while len(s)>0:
    if s.count(s[0])%2==1:
        answer="No"
        break
    s=s.replace(s[0],"")
print(answer)

Solution (Python):
def resolve():
    w = input()
    w_sets = set()

    [w_sets.add(w[x]) for x in range(0, len(w))]

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

    print('Yes')


resolve()

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

Solution (Python):
w = input()

li = set(w)

ans = [w.count(i) for i in li]

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

Solution (Python):
w = 0
codea = "a".encode()[0]
for x in input():
  w ^= 1 << (x.encode()[0] - codea)
print("No" if w!=0 else "Yes")

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

ls = list(w)
c = Counter(ls)

flg = "Yes"

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

print(flg)

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

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

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

Solution (Python):
w = list(input())
ans = {}
for i in w :
    if i in ans : ans[i] += 1
    else : ans[i] = 1
count = 0
for i in ans.keys():
    if ans[i] % 2 == 0 :
        pass
    else: count += 1
if count == 0: print("Yes")
else: print("No")

Solution (Python):
from collections import defaultdict

w = input()
d = defaultdict(int)
for l in w:
    d[l] += 1
ans = True
for n in d.values():
    if n % 2 == 1:
        ans = False
print('Yes' if ans else 'No')

Solution (Python):

s = input()
d = {}
flag = True
for i in s:
	if i in d:
		d[i] += 1
	else:
		d[i] = 1
	
for k in d:
	if d[k] % 2 == 1:
		flag = False
		break
if flag:	
	print("Yes")
else:
	print("No")

Solution (Python):
from collections import Counter
s=input()
c=Counter(s)
flag=0
a=list(c.values())
for i in range(len(a)):
  if a[i]%2==1:
    flag=1
    break
if flag==0:
  print("Yes")
else:
  print("No")

Solution (Python):
w=input()

n=list(set(w))

for i in n:
    x=w.count(i)
    if x%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):
l=input()
n=len(l)
ans=[]
for i in range(n):
    if l.count(l[i])%2==0:
        ans.append(0)
    else:
        ans.append(1)
        
print("Yes" if 1 not in ans else "No")

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

al = [chr(i) for i in range(97, 97+26)]
ans = "Yes"
for a in al:
  if w.count(a)%2 == 1:
    ans = "No"
    break

print(ans)

Solution (Python):

import itertools
import sys
import math
from functools import lru_cache





from queue import Queue
from operator import mul
from functools import reduce
from queue import Queue
from operator import mul
from functools import reduce
from functools import lru_cache














s = list(input())

m = {}
for c in s:
    if c in m:
        m[c] = m[c] + 1
    else:
        m[c] = 1

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

Solution (Python):

import itertools
import sys
import math
from functools import lru_cache





from queue import Queue
from operator import mul
from functools import reduce
from queue import Queue
from operator import mul
from functools import reduce
from functools import lru_cache














s = list(input())

m = {}
for c in s:
    if c in m:
        m[c] = m[c] + 1
    else:
        m[c] = 1

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

Solution (Python):
import collections


def main():
    w = input()
    d = collections.defaultdict(bool)

    for c in w:
        d[c] ^= True

    print('Yes' if all(v == False for v in d.values()) else 'No')


if __name__ == '__main__':
    main()

Solution (Python):
w = input()
d = dict()
for i in range(len(w)):
    c = w[i]
    count = d.get(c, 0)
    d[c] = count + 1
f = True
for k in d:
    if d[k] % 2 != 0:
        f = False
print("Yes" if f else "No")

Solution (Python):
from collections import Counter
w = input()
c = Counter(w)
print("Yes" if sum([c[k]%2 for k in c])==0 else "No")

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

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

store = [0 for i in range(26)]
for i in range(len(w)):
    store[ord(w[i]) - 97] += 1

for i in range(len(store)):
    store[i] = store[i] % 2

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