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 sys
input = sys.stdin.readline


def main():
    w = input().strip()
    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")


if __name__ == '__main__':
    main()

Solution (Python):

w = input()
numbers = []
is_beautiful = 'Yes'

for letter in w:
    numbers.append(w.count(letter))

for num in numbers:
    if num % 2 == 1:
        is_beautiful = 'No'

print(is_beautiful)

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

s = input()
c = Counter(s)
for key in c.keys():
    if c[key] % 2:
        print('No')
        break
else:
    print('Yes')

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

Solution (Python):
w=input()
count={w[0]:0}

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

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

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

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

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

d = Counter(w)
ans = "Yes"
for c in d:
    if d[c] % 2 == 1:
        ans = "No"
        break

print(ans)

Solution (Python):
w=str(input())
alphabet = ['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']
beautiful = True
for i in alphabet:
    if w.count(i)%2==1:
        beautiful = False
        break
if beautiful:
    print('Yes')
else:
    print('No')

Solution (Python):

S = input()
S1 = []
ab = [chr(ord('a') + i) for i in range(26)]
m = 0
n = 0
for i in range(len(S)):
    S1.append(S[i])
S2 = sorted(S)
for i in range(26):
    for j in range(len(S)):
        if S2[j] == ab[i]:
            m = m + 1
    if m % 2 != 0:
        n = n + 1
if n == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
w = sorted(list(input().strip()))
L = []

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

def evens(l):
  for j in l:
    if j % 2 != 0:
      return print('No')
  print('Yes')
    
evens(L)

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

zeros=''
zeros =zeros.zfill(26)
strs ="qwertyuiopasdfghjklzxcvbnm"
ret='Yes'
dic = dict(zip(strs, zeros))

for st in arr_str: 
    dic[st] = int(dic[st]) +  1

for it in dic.values():
    if( int(it) % 2 == 1):
        ret =  'No'
        break
    
print(ret)

Solution (Python):
def beautiful_strings(w):
    d = {}
    for c in w:
        if c in d:
            d[c] += 1
        else:
            d[c] = 1
    for val in d.values():
        if val % 2 == 1:
            return 'No'
    return 'Yes'

w = input()
print(beautiful_strings(w))

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

c = Counter(w)

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

Solution (Python):
from collections import Counter

w = input()
values, counts = zip(*Counter(w).most_common())
for count in counts:
    if count % 2 == 0:
        continue
    else:
        print('No')
        exit()
print('Yes')

Solution (Python):
n=input()

s=set(n)

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

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

for i in q:
  if s.count(i)%2==0:
    continue
  else:
    print("No")
    exit()
print("Yes")

Solution (Python):
w = input().strip()
C = {}
for i in range(len(w)):
    a = w[i]
    if a not in C:
        C[a] = 0
    C[a] += 1
flag = 0
for a in C:
    if C[a]%2==1:
        flag = 1
        break
if flag==0:
    print("Yes")
else:
    print("No")

Solution (Python):
w = list(input())
tmp1 = sorted(list(set(w)))
flag = 1
for i in range(len(tmp1)):
    count = 0
    for j in range(len(w)):
        if w[j] == tmp1[i]:
            count += 1
    if count%2 != 0:
        flag = 0
        break
if flag == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()

set_w = set(w)
count_w = [w.count(x) % 2 == 0 for x in set_w]

if all(count_w):
    print("Yes")
else:
    print("No")

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

Solution (Python):
w = input()

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

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

Solution (Python):
import numpy as np
w = input()

alp_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']

w_list = []
for s in w:
    w_list.append(s)

count_list = []
for i in alp_list:
    count = w_list.count(i)
    count_list.append(count)

div_array = np.array(count_list) % 2
div_list = div_array.tolist()

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

Solution (Python):
s = str(input())
t = list(s)
t.sort()
a = []
b = 1
for i in range(len(t)):
    if i >= 1:
        if t[i] == t[i-1]:
            b = b + 1
        else:
            a.append(b)
            b = 1
a.append(b)
for i in range(len(a)):
    if a[i] % 2 != 0:
        print("No")
        break
    else:
        if i == len(a) - 1:
            print("Yes")

Solution (Python):
import collections
w=str(input())
c=collections.Counter(w)
d=list(c.values())
for i in d:
    if i%2==1:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
w=input()
dic={}
for s in w:
  if s in dic:
    dic[s]+=1
  else:
    dic[s]=1
s=0
for key in dic:
  if dic[key]%2!=0:
    s+=1
if s == 0:
  print('Yes')
else:
  print('No')

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

d = {}

for word in w:
    if word in d: d[word]+=1
    else: d.update({word:1})

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

Solution (Python):
import collections



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

is_beaty = True
for n in c.values():
  if n % 2 == 1:
    is_beaty = False

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

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

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

Solution (Python):

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

S = si()
SS = set()
for s in S:
    SS.add(s)

for ss in SS:
    if S.count(ss)%2==1:
        print('No')
        exit()
print('Yes')

Solution (Python):
w = input()

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

Solution (Python):
import collections
table=collections.defaultdict(int)
for x in input():
  table[x]+=1
for x in table:
  if table[x]%2==1:
    print("No")
    exit(0)
print("Yes")

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

Solution (Python):
w = input()
alphabets = set(w)
for alp in alphabets:
    if w.count(alp) % 2 != 0:
        ans = "No"
        break

else:
    ans = "Yes"

print(ans)

Solution (Python):


S = list(input())

set_S = list(set(S))
beautiful = [S.count(i)%2 for i in set_S]
print('Yes' if sum(beautiful)==0 else 'No')

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

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

Solution (Python):
import sys

w = list(input())
alphabet = "abcdefghijklmnopqrstuvwxyz"
for i in alphabet:
    if w.count(i) % 2 != 0:
        print("No")
        sys.exit()
    
print("Yes")

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

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

print('NYoe s'[flag::2])

Solution (Python):
W=input()
import collections
c=collections.Counter(W)
ans=True
for val in (c.values()):
  if val%2==1:
    ans=False
print(("No","Yes")[ans])

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

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

Solution (Python):
import sys
import collections
string_array = list(input())
no_duplication = list(set(string_array))
for i in no_duplication:
    if string_array.count(i)  % 2 != 0:
        print('No')
        sys.exit()
print('Yes')

Solution (Python):

import math
w = list(input())

word_counter = {}
for i in w:
  if i in word_counter:
    word_counter[i] += 1
  else:
    word_counter[i] = 1

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

Solution (Python):
def main(w):
    characters = set(w)
    for c in characters:
        if w.count(c) % 2 != 0:
            return 'No'
    else:
        return 'Yes'


if __name__ == '__main__':
    W = input()
    print(main(W))

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

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

Solution (Python):
s = input()
for c in 'abcdefghijklmnopqrstuvwxyz':
    w = s.count(c)
    if w % 2 == 0:
        ans = 'Yes'
        continue
    else:
        ans = 'No'
        break
print(ans)

Solution (Python):
w = input()

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

Solution (Python):
S=input()
s=list(set(S))
ans=0
for i in range(len(s)):
    c=S.count(s[i])
    if c%2==0:ans+=1
    else:print("No") ;break
if ans==len(s):print("Yes")

Solution (Python):
from collections import Counter

c = Counter(input().strip())
for k,v in c.items():
  if v % 2 != 0:
    print('No')
    exit()
print('Yes')

Solution (Python):
mojiretsu = input()
mojiretsu_len = len(mojiretsu)
moji_list = []
hanntei = 0

for i in range(mojiretsu_len):
    moji_list.append(mojiretsu[i])

for j in range(mojiretsu_len):
    count_moji = moji_list.count(moji_list[j])
    kisuu_hanntei = count_moji%2
    if kisuu_hanntei==1:
        print("No")
        hanntei = 1
        break

if not hanntei==1:
    print("Yes")

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

Solution (Python):
w=input()

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

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

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

Solution (Python):
w = input()

w = sorted(w)
w.append("A")

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

Solution (Python):
w = input()

d = dict()

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

print('Yes' if all(map(lambda k: d[k] % 2 != 0, d)) else 'No')

Solution (Python):
def a():
    S = input()
    if(len(S) == 1):
        print("No")
        return

    s = list(S)
    s.sort()

    count = 0
    prec = 'A'
    for c in s:
        if(prec != c):
            prec = c
            if(count%2 == 1):
                print("No")
                return
            count = 0
        count += 1
    print("Yes")

a()

Solution (Python):
from collections import defaultdict

if __name__ == "__main__":
    letters = defaultdict(int)
    for letter in input():
        letters[letter] += 1
    for letter in letters:
        if letters[letter] % 2 != 0:
            print("No")
            exit()
    print("Yes")

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

Solution (Python):
S = input()
d = {}
for s in S:
	if s not in d:
		d[s] = 1
	else:
		d[s] += 1
for k in d:
	if d[k]%2 != 0:
		print('No')
		exit(0)
print('Yes')

Solution (Python):
from collections import Counter
d=Counter(input())
for k in d:
    if d[k]%2!=0:
        print('No')
        exit()
print('Yes')

Solution (Python):
import collections

w = input()
w = list(w)

c = collections.Counter(w)
flag = True
for _ in c.values():
    if _ % 2 == 1:
        flag = False
        break

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

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

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

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

for c in w:
    if c in d:
        d[c] += 1
    else:
        d[c] = 1
flag = True
for key in d.keys():
    if d[key]%2 == 1:
        flag = False
        break
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
import collections

w = input().rstrip()
counter = collections.Counter()
for c in w:
    counter[c] += 1
if sum(map(lambda x: x % 2, counter.values())) > 0:
    print('No')
else:
    print('Yes')

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

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

Solution (Python):
def slove():
    import sys
    import collections
    input = sys.stdin.readline
    w = collections.Counter(list(str(input().rstrip('\n'))))
    for k, v in w.items():
        if v % 2 != 0:
            print("No")
            exit()
    print("Yes")


if __name__ == '__main__':
    slove()

Solution (Python):
bun = input()
import collections
import sys

moji = [w for w in bun]
c = collections.Counter(moji)
c_list = list(c.values())
for count in c_list:
    if count%2 == 1:
        print('No')
        sys.exit()
print('Yes')

Solution (Python):
w = input()
wordbox = []
for i in range(len(w)):
    if(w[i] in wordbox):
        wordbox.remove(w[i])
    else:
        wordbox.append(w[i])

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

Solution (Python):
def resolve():
	w=input()
	s=list(w)
	chk=sum([w.count(i)%2 for i in s])
	print('Yes' if chk==0 else 'No')
resolve()

Solution (Python):
from collections import Counter

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

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

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

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

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

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

judge_list = [s.count(char_i)%2 for char_i in unique_s]
print('Yes' if sum(judge_list)==0 else 'No')

Solution (Python):

target = list(input())
char_dict = {}
for s in target:
  if s in char_dict:
    char_dict[s] += 1
  else:
    char_dict[s] = 1
flag = 0
for i in char_dict.values():
  if i % 2 == 1:
    flag = 1
if flag == 0:
  print("Yes")
elif flag == 1:
  print("No")

Solution (Python):
from collections import Counter
w=str(input())
li=Counter(w)
for i in range(len(w)):
    word=w[i]
    if i==len(w)-1:
        if li[word] % 2 == 0:
            print('Yes')
            break
        else:
            print('No')
            break
    if li[word]%2==0:
        continue
    else:
        print('No')
        break

Solution (Python):
w = input()

alpha = { chr(i): True for i in range(ord('a'), ord('z')+1) }

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

result = True
for b in alpha.values():
  result &= b

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

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

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

if len(ans)>1:
  while ans[-1]==ans[-2]:
    del ans[-2:]
    if len(ans)==0 or len(ans)==1:
      break

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

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

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

Solution (Python):
import collections

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

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

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

f=0

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

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

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

for ch in S:
    if not ch in count_table:
        count_table[ch] = 0
    count_table[ch] += 1

if all(x%2 == 0 for x in count_table.values()):
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()
A = ["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 = 0
k = []
for i in range(len(w)):
  k.append(w[i])
for i in range(26):
  if k.count(A[i])%2 == 0 or k.count(A[i]) == 0:
      continue
  else:
    a += 1
    print("No")
    break
if a == 0:
  print("Yes")

Solution (Python):
import sys
w = list(input())
ww = set(w)
for i in ww:
    s = 0
    for l in w:
        if i == l:
            s += 1
    if s%2 == 0:
        continue
    else:
        print('No')
        sys.exit()
print('Yes')

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

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

flg = 0

for i in range(len(w)):
    tmp = w.most_common()[i][1]
    
    if tmp % 2 == 1:
        flg = 1
        
if flg == 1:
    print("No")
else:
    print("Yes")

Solution (Python):


w = input()

for c in w:
    if w.count(c) % 2 == 0:
        continue
    else:
        print("No")
        exit()
else:
    print("Yes")

Solution (Python):


from collections import Counter

w = input()
c = Counter(w)

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

print(ans)

Solution (Python):
w = list(input())
alphabet = [chr(ord("a") + i) for i in range(26)]
result = "Yes"
for letter in alphabet:
  if w.count(letter) % 2 != 0:
    result = "No"
    break
print(result)

Solution (Python):
w=input()
c=0
if len(w)%2==1:
   print('No')
else:
   import string
   for _ in string.ascii_lowercase:
      if not w.count(_)%2==0:
         c+=1
   if c==0:
      print('Yes')
   else:
      print('No')

Solution (Python):

from collections import Counter


def main():
    S = input().rstrip()
    flg = all(i % 2 == 0 for i in Counter(S).values())
    print("Yes" if flg else "No")


if __name__ == "__main__":
    main()

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
S=input()

a=set([S.count(l) for l in "qwertyuiopasdfghjklzxcvbnm"])

if all(i%2==0 for i in a):
	print("Yes")
else:
	print("No")

Solution (Python):
a = input()
res = 0
for i in range(len(a)):
    if a.count(a[i]) % 2 == 0:
        res += 1

if res == len(a):
    print('Yes')
else:
    print('No')

Solution (Python):
w=input()
from collections import defaultdict
ans="Yes"
count=defaultdict(lambda: 0)
for i in range(len(w)):
    count[w[i]]+=1
for i in count.values():
    if i%2==1:
        ans="No"
print(ans)

Solution (Python):
w = input()
from collections import defaultdict
D = defaultdict(int)
 
for i in w:
    D[i]+=1
flag = 0
for i in D:
    if D[i]%2==1:
        flag = 1
        break
if flag==1:
    print("No")
else:
    print("Yes")

Solution (Python):
w = sorted(list(input()))
w_l = []
for i in range(0,len(w)):
    w_l.append(w[i])
    try:
        if w[i] != w[i+1]:
            w_l.append(" ")
    except:
        pass
w_l = "".join(w_l).split()
for j in w_l:
    if len(j)%2 == 0:
        continue
    else:
        print("No")
        exit()
print("Yes")

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

Solution (Python):
w = input()

N = len(w)

isBeautiful = True

for i in range(N):
    temp = w.count(w[i])
    if temp % 2 == 1:
        isBeautiful = False
        break

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

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

Solution (Python):
w=list(input())
w.sort()
ans="Yes"
for i in range(len(w)//2):
    if(w[2*i]!=w[2*i+1]):
        ans="No"
if(len(w)%2==1):
    ans="No"
print(ans)

Solution (Python):
from collections import defaultdict


def resolve():
    s = input()
    d = defaultdict(int)
    for c in s:
        d[c] += 1
    print("Yes" if all(v % 2 == 0 for v in d.values()) else "No")


if __name__ == "__main__":
    resolve()

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

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

Solution (Python):
from collections import Counter
def b():
    C = Counter(input()).values()
    for i in C:
        if i % 2 != 0:
            return "No"
    return "Yes"

print(b())

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

Solution (Python):
from collections import Counter

W = input()
counter = Counter(W)

Flag = True
for v in counter.values():
    if v % 2 != 0:
        Flag = False

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

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

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

Solution (Python):
import re
w = input()
i =0
k = 0
a = 'abcdefghijklmnopqrstuvwxyz'
for i in  range(26):
    if ((len(re.findall(a[i] , w)) %2) == 0):
        k += 1
    i +=1
if k == 26:
    print('Yes')
else:
    print('No')

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

Solution (Python):
w = input()

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

print('Yes')

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

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

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 =list(input())
ans = "Yes"
if len(w)%2 !=0:
    ans = "No"
else:
    w.sort()
    for i in range(len(w)//2):
        if w[2*(i-1)] == w[2*i-1]:
            continue
        else:
            ans ="No"
            break
        print
print(ans)

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

    dic = {}
    for c in w:
        if c in dic:
            dic[c] += 1
        else:
            dic[c] = 1
    
    ok = True
    for key, value in dic.items():
        if value&1:
            ok = False
            break
    
    if ok:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
dict = {}
data = input()

for i in range(len(data)):
  if data[i] in dict.keys():
    dict[data[i]] = (dict[data[i]] + 1)%2
  else:
    dict[data[i]] = 1
    
if 1 in dict.values():
  print("No")
else:
  print("Yes")

Solution (Python):
W=input()
count=1
w=[]

for j in range(len(W)):
    w.append(W[j])

w.sort()

w.append("")

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

print("Yes")

Solution (Python):
from collections import Counter

w = input()
c = Counter(w)
word = []

for i in c:
    word.append(i[0])

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

Solution (Python):
s = list(input())
n = 0
for i in range(len(s)):
    if s.count(s[i])%2 == 0:
        n += 1
if n == len(s):
    print("Yes")
else:
    print("No")

Solution (Python):
w=input()
a='Yes'
s='qwertyuiopasdfghjklzxcvbnm'
for i in range(26):
	if w.count(s[i])%2!=0:
		a='No'
		break
print(a)

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

Solution (Python):
w=input()

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

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

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

Solution (Python):
from collections import Counter

counter = Counter(input())
print('Yes' if all(c % 2 == 0 for c in counter.values()) else 'No')

Solution (Python):
from collections import defaultdict

a = defaultdict(int)
for w in input():
  a[w] += 1
print('Yes' if sum(c % 2 for c in a.values()) == 0 else 'No')

Solution (Python):
def q69(w):
    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:
            return 'No'
        
    return 'Yes'
            
w = list(input())
print(q69(w))

Solution (Python):
def solve():
    w = input()
    word_dict = {}
    for word in w:
        if word in word_dict:
            word_dict[word] += 1
        else:
            word_dict[word] = 1
    
    ret = all(count%2 == 0 for count in word_dict.values())
    print('Yes' if ret else 'No')
    
solve()

Solution (Python):
s = input()
 
flag = 1
for i in range(len(s)):
  if s.count(s[i])%2 == 1:
    print("No")
    flag = 0
    break

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

Solution (Python):
s=input()
s=sorted(s)
a=1
if len(s)%2==1:
  a=0
else:
  for i in range(len(s)//2):
    if s[2*i]==s[2*i+1]:
      a*=1
    else:
      a*=0
if a==1:
  print('Yes')
else:
  print('No')

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")
        exit()
print('Yes')

Solution (Python):



w = input()



dic = {}
for i in range(len(w)):
    
    
    key = w[i]
    if key in dic:
        dic[key] += 1
    else:
        dic[key] = 1



flag = True
for val in list(dic.values()):
    
    if val % 2 != 0:
        flag = False


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

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

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

Solution (Python):
w1 = [s for s in input()]
w2 = [w1.count(a) for a in list(set(w1))]
w3 = [w for w in w2 if w % 2 == 0]
print(('Yes' if  len(w3) == len(w2) else 'No'))

Solution (Python):
w = input()
counter = {}
flg = -1
for c in w:
    if not c in counter:
        counter[c] = 1
    else:
        counter[c] += 1
for i in counter.values():
    if i % 2 == 0:
        flg = 1
    else:
        flg = 0
        break
if flg == 1:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
s = str(input())
alphabets = set(s)
flag = 0
for char in alphabets:
  if s.count(char) % 2 !=0:
    flag = 1
if flag == 1:
  print('No')
else:
  print('Yes')

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

Solution (Python):
w = list(map(input().count,[chr(i) for i in range(97, 97+26)]))
for i in range(len(w)):
  if w[i]%2 != 0:
    print('No')
    break
else:
  print('Yes')

Solution (Python):
import collections

cha_num = collections.Counter(input())

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