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):
import collections

def main():
    w = list(input())
    ans = "Yes"
    for c, freq in collections.Counter(w).items():
        if freq % 2 == 1:
            ans = "No"
            break
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
from string import ascii_lowercase


def main():
    string = input()
    count = {}
    for lowercase in ascii_lowercase:
        count[lowercase] = 0
    for s in string:
        count[s] += 1
    answer = True
    for c in count.values():
        if c % 2:
            answer = False
    print("Yes" if answer else "No")


if __name__ == '__main__':
    main()

Solution (Python):
w = input()
dic = {}
for i in w:
    if i in dic:
        dic[i] += 1
    else:
        dic[i] = 1
for k,v in dic.items():
    if v % 2 == 1:
        print('No')
        exit()
print('Yes')

Solution (Python):
import sys







from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29

def main():
    w = input()
    if len(w)%2!=0:
        print('No')
        return
    s = sorted(w)
    for i in range(0,len(s),2):
        if s[i]!=s[i+1]:
            print('No')
            return
    print('Yes')
    return

if __name__=='__main__':
    main()

Solution (Python):
from collections import Counter
w = list(Counter(list(input())).items())
if all(w[i][1]%2==0 for i in range(len(w))):
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter
w=input()
d=Counter()
for i in w:
  d[i]+=1
flag=True
for i,j in d.items():
  if j%2!=0:
    flag=False
print("Yes") if flag==True else print("No")

Solution (Python):
w = input()

d = {}
for c in w:
    if c in d:
        d[c] += 1
    else:
        d[c] = 1
if all(v % 2 == 0 for v in d.values()):
    print('Yes')
else:
    print('No')

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

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

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

result = 'Yes'
for i in w_set:
    if w.count(i)%2 ==0:
        pass
    else:
        result = 'No'
print(result)

Solution (Python):
word = input()
wset = set(word)
a = 'Yes'
for w in wset:
  if word.count(w) % 2 != 0:
    a = 'No'
print(a)

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

Solution (Python):
from collections import Counter

w = list(input())
c = Counter(w)

flag = True
for k, v in c.items():
    if v % 2 == 0:
        pass
    else:
        flag = False
        break

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

Solution (Python):
from collections import Counter
w=list(input())
ww=Counter(w)
for k,v in ww.items():
        if v%2!=0:
            print('No')
            exit()
print('Yes')

Solution (Python):


from collections import defaultdict

a = input()

b = defaultdict(int)


for c in a:
    b[c] += 1

d = []

for c in b.values():
    d.append(c % 2)

e = set(d)

ans = 'No' if 1 in e else 'Yes'

print(ans)

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

print(ans)

Solution (Python):
from collections import Counter

w = input()
c = Counter(w)
ans = 'Yes'

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

Solution (Python):
w=input()
for i in range(97,123):
  cnt=0
  for j in range(len(w)):
    if w[j]==chr(i):
      cnt+=1
  if cnt%2==1:
    print("No")
    break
  elif i==122 and cnt%2==0:
    print("Yes")

Solution (Python):


w = input()
token = set(w)

flag = True
for tok in token:
  if w.count(tok)%2 == 1:
    flag = False
    break

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

Solution (Python):
from collections import Counter

W=list(input())
A=Counter(W)
N=len(A)
count=0
for i in A.values():
  if i%2==0:
    count+=1
if count==N:
  print("Yes")
else:
  print("No")

Solution (Python):

import sys


YES = "Yes"  
NO = "No"  


def solve(w: str):
    print(YES if all(
        w.count(chr(c)) % 2 == 0
        for c in range(ord("a"), ord("z") + 1)
    ) else NO)


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):
w = input()
word_count = {}
for i in w:
    if i in word_count:
        word_count[i] += 1
    else:
        word_count[i] = 1

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

Solution (Python):
w = input()

w = sorted(w, key = lambda x: x)
word_count = {}
for i in w:
    if i in word_count:
        word_count[i] += 1
    else:
        word_count[i] = 1

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

Solution (Python):
w = input()

w = sorted(w, key = lambda x: x)
ans = 1
before = w[0]
for i in range(1, len(w)):
    if w[i] == before:
        ans += 1
    else:
        if ans % 2 != 0:
            print("No")
            exit()
        before = w[i]
        ans += 1

if ans % 2 != 0:
    print("No")
    exit()
print("Yes")

Solution (Python):
from collections import Counter

n = Counter(input())
ans = True
for i in n.values():
    if i % 2 == 0:
        continue
    else:
        print('No')
        ans = False
        break

if ans:
    print('Yes')

Solution (Python):
w=input()
l='abcdefghijklmnopqrstuvwxyz'
a=0


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

Solution (Python):
W = input()
dic = {}
for w in W:
  if w in dic:
    dic[w] += 1
  else:
    dic[w] = 1
flg = True
for v in dic.values():
  if v % 2 != 0:
    flg = False
if flg:
  print('Yes')
else:
  print('No')

Solution (Python):
import collections

w=list(input())
c=collections.Counter(w)
for i  in c.values():
	if i%2==1:
		print("No")
		exit()
print("Yes")

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

Solution (Python):
w=input()
moji=set(w)
for m in moji:
    if w.count(m)%2==1:
        print("No")
        exit()
print("Yes")

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

Solution (Python):
li = list(input())
li_w = set(li)

ans = True

for i in li_w:
    u = li.count(i)
    if u % 2:
        ans = False

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

Solution (Python):
from collections import Counter

w = input()
counter = Counter(w)

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

Solution (Python):
w=input()
x=dict()
for i in range(len(w)):
    if w[i] in x:
        x[w[i]]+=1
    else:
        x[w[i]]=1

for idx in x:
    if x[idx]%2!=0:
        print("No")
        exit()
print("Yes")

Solution (Python):
s=input()
import collections
c=collections.Counter(s)
value=list(c.values())
for k in range(len(value)):
    if value[k]%2==1:
        print("No")
        import sys
        sys.exit()
print("Yes")

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

Solution (Python):
s = input()

import collections
c = collections.Counter(s)
for i in c.values():
    if i%2!=0:
        print("No")
        exit()
print("Yes")

Solution (Python):
import collections

w = input()

c = dict(collections.Counter(w))

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

print("Yes")

Solution (Python):
from collections import Counter
c = Counter(list(input()))
for k, v in c.items():
    if v%2 != 0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):


import collections

w = input()

a = list(collections.Counter(w).values())
b = [a[i] for i in range(len(a)) if int(a[i]) % 2 == 0]


if len(a) == len(b):
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
w = input()

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

print("Yes")

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

flag = True
for v in c.values():
    if v%2!=0: flag = False
    
print('Yes' if flag else 'No')

Solution (Python):
w = input()
s = {w.count(c) for c in set(w)}
print('YNeos'[any(i%2 for i in s)::2])

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

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

if flag == 0:
  print('Yes')

Solution (Python):
import collections
w=list(input())
c=collections.Counter(w)
flag=0
l=list(c.values())
for i in range(len(l)):
    if not(l[i]%2==0):
        flag=1


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

Solution (Python):
alphabet = "abcdefghijklmnopqrstuvwxyz"
w = list(input())

for alpha in alphabet:
    if w.count(alpha) % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w = input()
for c in w:
  if w.count(c)&1:
    print('No')
    exit()
print('Yes')

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

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

for _ in range(len(lst)//2):
    if lst[-1] == lst[-2]:
        lst = lst[:-2]
print('Yes' if len(lst)==0 else 'No')

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

flag = True

for ss in s:
    if w.count(ss) % 2 != 0:
        flag = False
        break

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

Solution (Python):
e = input()
set_e = set(e)
is_beautiful = 'Yes'
for i in set_e:
    if e.count(i)%2 == 1:
        is_beautiful = 'No'
        break
    else:
        pass
print(is_beautiful)

Solution (Python):
W = input()
alpha = []
num = []
for char in W:
    if char in alpha:
        num[alpha.index(char)] += 1
    else:
        alpha.append(char)
        num.append(1)

ans = 'Yes'
for n in num:
    if n % 2 == 1:
        ans = 'No'
        break

print(ans)

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

bl = True;
for v in c.values():
  if v%2==1:
    bl = False

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

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

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

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

w = input()
l = Counter(w)
for i,j in l.items():
    if not j % 2 == 0:
        print("No")
        exit()
print("Yes")

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

Solution (Python):

w = input()

w_list = list(w)
alphabet = dict.fromkeys("abcdefghijklmnopqrstuvwxyz",0)
beautiful = True

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

for i in alphabet :
    if alphabet[i]%2 != 0 :
        beautiful = False

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

Solution (Python):
w = input()
fl = True
for j in w:
    if w.count(j)&1:
        fl = False
print('Yes') if fl else print('No')

Solution (Python):
w = input()
a = [0 for _ in range(26)]

for i in range(len(w)):
    s = ord(w[i]) - ord("a")
    a[s] += 1

for i in range(26):
    if a[i] % 2 == 1:
        print("No")
        break
else:
    print("Yes")

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

Solution (Python):
s = input()
d = dict()
for c in s:
    if c in d:
        d[c] += 1
    else:
        d[c] = 1
for v in d.values():
    if v % 2 !=0:
        print("No")
        exit(0)
print("Yes")

Solution (Python):
from collections import Counter
a = input()
b=Counter(a)
x=b.values()
for s in x:
    if s % 2 != 0:
       print ("No")
       break
else:
    print("Yes")

Solution (Python):
import collections
s=list(input())
l=collections.Counter(s)
a=all(v%2==0 for v in l.values())
print("Yes" if a==True else "No")

Solution (Python):
import collections
w = input()
a = list(w)
b = collections.Counter(a)
for i in b.keys():
	if b[i] %2 == 1:
		print ("No")
		exit()
print ("Yes")

Solution (Python):
s = input()
d = dict()
for c in s:
  if c in d:
    d[c] += 1
  else:
    d[c] = 1
for v in d.values():
  if v % 2 != 0:
    print('No')
    exit()
print('Yes')

Solution (Python):
S = input()
D = {}
for i in S:
  if i in D:
    D[i] += 1
    D[i] %= 2
  else:
    D[i] = 1
if sum(D[i] for i in D) == 0:
  print("Yes")
else:
  print("No")

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

for i in w_set:
    if w.count(i)%2==1:
        print("No")
        exit()
print("Yes")

Solution (Python):
s= input()
 
char_list = [ chr(ord('a')+num) for num in range( 26 ) ]

ind = 0
for i in char_list:
  if s.count(i) % 2 != 0:
    ind = 1
    break
if ind == 1:
  print("No")
else:
  print("Yes")

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

Solution (Python):
from collections import Counter
C = Counter(input())
print("YNeos"[any(v&1 for v in C.values())::2])

Solution (Python):




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

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


if __name__ == "__main__":
    main()

Solution (Python):
from collections import Counter
 
n = Counter(input())
 
for i in n.values():
  if i%2==1:
    print("No")
    break

else:
  print("Yes")

Solution (Python):
str = input()
list = []
for x in range(len(str)):
    list.append(str[x])
list.sort()
if len(str) % 2 != 0: print("No")
else: 
    iscount = True
    for x in range(int(len(str) / 2)):
        if list[2 * x] != list[2 * x + 1]: iscount = False
    if iscount == True: print("Yes")
    else:print("No")

Solution (Python):
w = list(input())
import collections
c = collections.Counter(w)
li = list(c.values())
ans = "Yes"
for i in range(len(li)) :
    if li[i] % 2 == 1 :
        ans = "No"
        break
print(ans)

Solution (Python):


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

c="Yes"
for k,v in d.items():
    if v%2 !=0:
        c="No"


print(c)

Solution (Python):
w = input()

w_dict = dict()
for i in range(len(w)):
    if w[i] in w_dict:
        w_dict[w[i]] += 1
    else:
        w_dict[w[i]] = 1
        
for v in w_dict.values():
    if v % 2 != 0:
        print("No")
        exit()
        
print("Yes")

Solution (Python):
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys
import itertools

import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S = readline().decode('utf8').rstrip()
se = set(S)

ans = True
for m in se:
    if S.count(m) % 2 != 0:
        ans = False

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

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

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

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

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

Solution (Python):
w = list(input())
moji = set()
ans = 'Yes'
for i in range(len(w)):
    moji.add(w[i])

for i in moji:
    if (w.count(i) % 2)!= 0:
        ans = 'No'

print(ans)

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

Solution (Python):
n=input()
l=set(list(n))
b=True
for x in l:
    if n.count(x)%2==1:b=False
if b:print("Yes")
else:print("No")

Solution (Python):
import string
count = 0
lis = input()
for i in string.ascii_lowercase:
    if not lis.count(i)%2 == 0:
        count += 1
        break

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

Solution (Python):
def groupby(a):
    a2=[[a[0],1]]
    for i in range(1,len(a)):
        if a2[-1][0]==a[i]:
            a2[-1][1]+=1
        else:
            a2.append([a[i],1])
    return a2
w=list(input())
w.sort()
w=groupby(w)
for i in w:
    if i[1]%2==1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
a=list(input())
a.sort()
ans = 'Yes'
if len(a)%2==1:
  ans='No'
else:
  for i in range(0,len(a),2):
    if a[i]!=a[i+1]:
      ans='No'
print(ans)

Solution (Python):
from collections import Counter

w = input()

count = Counter(w)

judge = True

for v in count.values():
    if v % 2 == 1:
        judge = False

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

Solution (Python):
w = input()

t = set()
for i in w:
    t.add(i)

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

print('Yes')

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

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

letters = "abcdefghijklmnopqrstuvwxyz"
flg = True
for letter in letters:
    num = w.count(letter)
    if num % 2 != 0:
        flg = False
        break
if flg:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()

for c in w:
  if w.count(c) % 2:
    print("No")
    quit()
  
print("Yes")

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

Solution (Python):

import numpy as np

w = input()
alpha = np.full(26,0)

for i in range(len(w)):
    alpha[ord(w[i])-ord('a')] += 1

flg = True
for i in range(26):
    if alpha[i]%2 != 0:
        flg = False

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

Solution (Python):
import sys

w = input()
letters = dict()

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

for _, v in letters.items():
    if v % 2 != 0:
        print('No')
        sys.exit()

print('Yes')

Solution (Python):
def solve(w):
    d = {}
    for l in w:
        d[l] = (d[l] + 1) if l in d else 1
    return 'Yes' if all(v % 2 == 0 for v in d.values()) else 'No'

_w = input()
print(solve(_w))

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

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

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

Solution (Python):
from collections import Counter

def is_this_a_beautiful_sentence(sentence):

    letter_count = Counter(sentence)
    for c in letter_count.values():
        if c % 2 == 1:
            return 'No'
    
    return 'Yes'

if __name__=='__main__':
    print(is_this_a_beautiful_sentence(input()))

Solution (Python):
abc ="abcdefghijklmnopqrstuvwxyz"
word = input()
num = 0
for i in range(26):
    for j in range(len(word)):
        if word[j] == abc[i]:
            num = num + 1
    if num % 2 != 0:
        break
    num = 0
if num % 2 != 0:
    print("No")
else:
    print("Yes")

Solution (Python):
import sys
import numpy as np


w = input()

char_cnt = np.zeros(27)

for c in w:
    
    i = ord(c) - ord('a')
    
    char_cnt[i] += 1


char_mod = char_cnt % 2

if char_mod.sum() == 0:
    
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter
print('YNeos'[any([j%2!=0 for i,j in Counter(input()).items()])::2])

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

Solution (Python):
from collections import defaultdict
s=list(input())
d=defaultdict(int)
for i in s:
  d[i]+=1
for i in d.values():
  if i%2:
    print("No")
    break
else:
  print("Yes")

Solution (Python):
w = input()

letters = ['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', ]

counts = []

for letter in letters:
  counts.append(w.count(letter))

isEven = True
for c in counts:
  if (c % 2 == 1):
    isEven = False

result = 'Yes' if isEven else 'No'
print(result)

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

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

print("Yes" if count_number == len(count_w) else "No")

Solution (Python):
import re

if __name__ == "__main__":
    word = input()
    s = re.compile("[a-z]+")
    ans = "Yes"
    if s.fullmatch(word) is not None:
        unique_w = list(set(word))
        for w in unique_w:
            if word.count(w) % 2 != 0:
                ans = "No"
        

    print(ans)

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

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

Solution (Python):
abc_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']

if __name__ == '__main__':
	w = input()
	w = [s.split()[0] for s in w]

	check = 0
	
	for i in abc_list:
		if w.count(i) % 2 != 0:
			check = 1
			break

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

Solution (Python):
from collections import Counter

in_s = input()

def judge(s):
    cnt = Counter(list(s))
    for _, v in cnt.items():
        if v % 2 != 0:
            return False
    return True

if judge(in_s):
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
s = input()

res = 'Yes'

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

print(res)

Solution (Python):
s=[]
t=input()
for i in range(ord("a"),ord("z")+1):
    s.append(t.count(chr(i)))
for i in range(len(s)):
    if s[i]%2 != 0:
        print("No")
        exit(0)
print("Yes")

Solution (Python):
from collections import Counter
c1 = Counter(input())
for c in c1:
  if c1[c] % 2 != 0:
    print('No')
    break
else:
  print('Yes')

Solution (Python):
w = input()
checked_char = ""
r = 'Yes'
for c in w:
  if c not in checked_char:
    if (w.count(c)) % 2 == 1:
      r = 'No'
      break
    checked_char += c
    
print(r)

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

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

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

flag = True
for c in [chr(i) for i in range(97, 97+26)]:
    count = 0
    for i in range(len(w)):
        if w[i] == c:
            count += 1
    if count % 2 == 0:
        pass
    else:
        flag = False

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

Solution (Python):
import sys
input = sys.stdin.readline
w=input().strip()
from collections import Counter
s=Counter(w)
for a in s.values():
    if a%2==1:
        print("No")
        exit()
print("Yes")

Solution (Python):
s = input()
w = {}
ret = 'Yes'

for i in range(len(s)):
    if s[i] in w:
        w[s[i]] = w[s[i]] + 1
    else:
        w[s[i]] = 1

for num in w:
    if (w[num] % 2) == 1:
        ret = 'No'
        break

print(ret)

Solution (Python):
w = input()
ans = "Yes"
for letter in set(w):
    cnt = w.count(letter)
    if cnt % 2 != 0:
        ans = "No"
    else:
        continue
print(ans)

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

Solution (Python):
w=list(input())
alpha=[0 for i in range(26)]
ans="Yes"
for i in range(len(w)):
    alpha[ord(w[i])-97]+=1

for i in range(26):
    num=alpha[i]
    if num!=0 and num%2!=0:
        ans="No"
        break
print(ans)

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    ws=STR()
    alp='abcdefghijklmnopqrstuvwxyz'
    ans=[0]*26
    flg=1
    for w in ws:
        ct=alp.index(w)
        ans[ct]+=1
    for i in ans:
        if i%2==1:
            flg=0
    if flg==1:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

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

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

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

Solution (Python):
s=input()
ss=set(s)
ans="Yes"
for sss in ss:
  if s.count(sss)%2==1:
    ans="No"

print(ans)

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

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

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

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

Solution (Python):
W = sorted(input())
n = len(W)
if n % 2 == 1:
    print('No')
    exit()

for i in range(0, n, 2):
    w1, w2 = W[i], W[i+1]
    if w1 != w2:
        print('No')
        exit()

print('Yes')

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

c = collections.Counter(s)

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

print('Yes')

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

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

Solution (Python):
import collections

w = input()

wc = collections.Counter(w).most_common()
for i in wc:
    if i[1] % 2:
        print("No")
        exit()

print("Yes")

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

Solution (Python):
from collections import defaultdict
chars = input()

d = defaultdict(int)

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

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

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

Solution (Python):

from collections import Counter
alp = "abcdefghijklmnopqrstuvwxyz"
w = input()
cnt = dict(Counter(w))
flag = True
for a in alp:
    try:
        if cnt[a] % 2 == 1:
            flag = False
            exit()
    except:
        pass
print("Yes" if flag else "No")

Solution (Python):
w = input()

alphabet = set(w)
for a in alphabet:
    if w.count(a) % 2 != 0:
        import sys
        print('No')
        sys.exit()

print('Yes')

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

Solution (Python):
w = input()

word_list = "abcdefghijklmnopqrstuvwxyz"
flag = True

for i in word_list:
    if w.count(i) % 2:
        flag = False
        break
print("Yes" if flag else "No")

Solution (Python):
import sys
input = sys.stdin.readline
from collections import Counter
w = list(input().rstrip())
c = Counter(w)
for i in c.values():
    if i % 2 != 0:
        print("No")
        sys.exit()
    else:
        pass
print("Yes")

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

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

alphabets = [chr(ord('a') + i) for i in range(26)]

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

Solution (Python):


w = input()

isBeaut = True
for i in set(w):
    if w.count(i)%2 == 1:
        isBeaut = False

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

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

for i in dic:
  if dic[i]%2 != 0:
    print('No')
    break
else:
  print('Yes')