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):
from collections import defaultdict as dd
w=input()
dic=dd(int)
for char in w:
    dic[char] += 1
for val in dic.values():
    if val%2!=0:
        print('No')
        exit()
print('Yes')

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

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

for i in range(len(w)):
    if w[i] not in d:
        d[w[i]] = 1
    else:
        d[w[i]] += 1
        
for count in d.values():
    if count % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):

import sys
from collections import Counter
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    c=Counter(input())
    for x in c.values():
        if x%2:
            print('No')
            break
    else:
        print('Yes')

if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter

w = input()
c = Counter(w)
if all(map(lambda x: x % 2 == 0, c.values())):
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
w = list(input())
w.sort()
i = 0
if len(w) % 2 == 1:
    print('No')
    exit()

while i < len(w)-1:
	if w[i] != w[i+1]:
		print('No')
		exit()
	i += 2
else:
	print('Yes')

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

Solution (Python):
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()

w = input()
while w != "":
    if w.count(w[0])%2==0:
        w = w.replace(w[0],"")
    else:
        break
if w == "":
    print("Yes")
else:
    print("No")

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

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

for k, v in d.items():
    bl = bl and v%2==0

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

Solution (Python):
from collections import Counter

w = list(input())
C = Counter(w)

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

Solution (Python):
S = list(input())
A = []
for i in S:
  if i in A:
    A.remove(i)
  else:
    A.append(i)
if len(A) == 0:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):
w=list(input())
s=set(w)
flag=True
for i in s:
    if w.count(i)%2==0:
        continue
    else:
        flag=False
        break
print('Yes' if flag==True else 'No')

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

Solution (Python):
def main():
  string = input()
  flg=0
  while len(string)!=0:
    if(string.count(string[0])%2==0):
      string=string.replace(string[0],'')
    else:
      flg=1
      break
  if flg==0:
    print('Yes')
  else:
    print('No')  
main()

Solution (Python):


import sys

from string import ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits




















def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    w = input()

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


if __name__ == "__main__":
    main()

Solution (Python):
from sys import exit

w = input()

d = dict()
for letter in w:
  d[letter] = d.get(letter, 0) + 1
  
for key in d:
  if d[key] % 2:
    print("No")
    exit()
    
print("Yes")

Solution (Python):

w = input()
print(['Yes', 'No'][any(w.count(c) % 2 for c in set(w))])

Solution (Python):

count = {}
for c in input():
    if c in count:
        count[c] = not(count[c])
    else:
        count[c] = False

print(['Yes', 'No'][False in count.values()])

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

from collections import Counter
a=Counter(a)

for i in a.items():
    if i[1]%2 != 0:
        print('No')
        exit()

print('Yes')

Solution (Python):
W=input()

ans='Yes'
A='abcdefghijklmnopqrstuvwxyz'
i=0
while i<26:
    if W.count(A[i])%2==1:
        ans='No'
    i+=1

print(ans)

Solution (Python):
s=str(input())
s=list(s)
sset=set(s)
sset=list(sset)
for i in range(0,len(sset)):
  temp=s.count(sset[i])
  if temp%2!=0:
    print("No")
    break
else:
  print("Yes")

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

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

Solution (Python):
from collections import Counter


def main():
    w = input()
    x = Counter(w)
    for c, n in x.items():
        if n % 2:
            print('No')
            return
    print('Yes')
    return


if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter
w = input()
w = list(w)
s = Counter(w)
n = 0
for i in s.values():
    if i % 2 == 0:
        n += int(i/2)
        
if len(w)/2 == n:
    print("Yes")
    
else:
    print("No")

Solution (Python):
from collections import defaultdict

w = list(input())

alphabet_count_dict = defaultdict(int)

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

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

print("Yes")

Solution (Python):
import collections
s = input()
t = collections.Counter(s)
v = t.values()
if all([vv % 2 == 0 for vv in v]):
	print("Yes")
else:
	print("No")

Solution (Python):
from sys import stdin

def S(): return stdin.readline().rstrip()
def I(): return int(stdin.readline().rstrip())
def LS(): return list(stdin.readline().rstrip().split())
def LI(): return list(map(int,stdin.readline().rstrip().split()))

w = S()

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

print('Yes')

Solution (Python):
import math
import copy

neko = "Yes"
w = input()
for a in ['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']:
    nya = len(w)
    if (nya-len(w.replace(a,'')))%2:
        neko = "No"
        break
print(neko)

Solution (Python):
from collections import Counter
l=[]
count=0
l=list(input())
for i in Counter(l).values():
    if i%2==1:
        count+=1
if count!=0:
    print('No')
else:
    print('Yes')

Solution (Python):
w = input()
ww = set(w)
check = []
ans = 0

for i in ww:
    check.append(w.count(i))

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

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

Solution (Python):
from sys import exit

w = input()
n = len(w)

cnt = [0]
c = w[0]
sw = sorted(w)
for i in range(n):
    if sw[i] == c:
        cnt[-1] += 1
    else:
        c = sw[i]
        cnt.append(1)
for i in range(len(cnt)):
    if cnt[i]%2 == 1:
        print("No")
        exit()
print("Yes")

Solution (Python):
from collections import Counter
import numpy as np

w = list(map(str, input().rstrip()))
x = np.array(list(Counter(w).values()))

print("Yes") if np.mod(x, 2).sum()==0 else print("No")

Solution (Python):
import sys

input = sys.stdin.readline

def main():
    ans = 'Yes'
    w = input().rstrip('\n')
    s = set(w)
    for i in s:
        if w.count(i)%2 != 0:
            ans = 'No'
            break
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
a = [0]*26
s = input()
for i in range(len(s)) :
	a[ord(s[i])-ord('a')] += 1
cek = True
for i in range(len(a)) :
	if a[i] % 2 == 1:
		cek = False
		break
if (cek) :
	print("Yes")
else :
	print("No")

Solution (Python):
ss = input()

ll = {}
for i in range(97, 97 + 26):
    ll[chr(i)] = 0

for s in ss:
    ll[s] += 1

for l in ll.keys():
    if ll[l] % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
def cin():
	return map(int,input().split())

def cino(test=False):
    if not test:
        return int(input())
    else:
        return input()
def cina():
  return list(map(int,input().split()))

def hashing(my_list):   
    freq = {} 
    for item in my_list: 
        if (item in freq): 
            freq[item] += 1
        else: 
            freq[item] = 1  
    return freq

a = cino(True)
a = list(a)
h = hashing(a)
check = False
for key, value in h.items():
    if value%2!=0:
        check = True
        break
if check:
    print("No")
else:
    print("Yes")

Solution (Python):
buf = input()
d = {}
for s in buf:
    if (s in d) == False:
        d[s] = 1
    else:
        d[s] += 1
nums = d.values()
oddExist = False
for num in nums:
    if num % 2 != 0:
        oddExist = True
if oddExist == False:
    print('Yes')
else:
    print('No')

Solution (Python):
w = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = [0] * 26
word = 'Yes'
for i in w:
  ans[alpha.index(i)] += 1

for i in ans:
  if i % 2 == 0:
    pass
  else:
    word = 'No'
    break

print(word)

Solution (Python):
w = input()
word_count = {c:w.count(c) for c in set(w)}
flg = True
for count in word_count.values():
    if count % 2:
        flg = False

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

Solution (Python):
w = input()
wl = []
for i in range(len(w)):
    wl.append(w[i])

from collections import Counter
W = Counter(wl)

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

Solution (Python):
w = sorted(input())
if len(w) % 2:
    print('No')
else:
    for i in range(0, len(w), 2):
        if w[i] == w[i+1]:
            continue
        else:
            print('No')
            break
    else:
        print('Yes')

Solution (Python):
a=list(map(input().count,"abcdefghijklmnopqrstuvwxyz"))
ng=False
for x in a:
  if x%2: ng=True
print("YNeos"[ng::2])

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

w = sorted(w)
check = list(sorted(set(w)))

for i in range(len(check)):
    if w.count(check[i])%2 == 1:
        print("No")
        exit()

print("Yes")

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

Solution (Python):
w = input()
s = 'a'

ans = 'Yes'

for i in range(26):
    if w.count(s) % 2 != 0:
        ans = 'No'
        break

    s = chr(ord(s) + 1)

print(ans)

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

from collections import Counter
def resolve():
    w=input()
    a=Counter(w)
    for j in a.values():
        if j%2:print("No");return
    print("Yes")

resolve()

Solution (Python):
w = input()
a = "abcdefghijklmnopqrstuvwxyz"
w_list = list(a)
hoge = 0
for word in w_list:
  s = w.count(word)
  if s%2 != 0:
    print('No')
    hoge += 1
    break
if hoge == 0:
  print('Yes')

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

Solution (Python):
word = input()
result = "Yes"
abc = (set(word))
abc = "".join(abc)
for i in abc:
    
    if word.count(i) %2 ==1:
        result = "No"
        break
        
print(result)

Solution (Python):
s = input()

lAlp = [0 for i in range(26)]

for i in range(len(s)):
    num = ord(s[i]) - ord('a')
    lAlp[num] += 1
    
for i in range(26):
    if(lAlp[i] % 2 == 1):
        print('No')
        break

else:
    print('Yes')

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

Solution (Python):
w=input()
ans={}
k=0
for i in w:
    if i not in ans:
        ans[i]=1
    else :
        ans[i]+=1
for i in ans:
    if ans[i]%2==1:
        print("No")
        break
else :
    print("Yes")

Solution (Python):
from collections import Counter

s = list(input())

c = Counter(s)

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

Solution (Python):
from collections import defaultdict

w = input()
d = defaultdict(int)
for s in w:
    d[s] += 1

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

Solution (Python):
import collections

dic = collections.Counter(list(input()))
for i, v in dic.items():
  if v % 2 != 0:
    print('No')
    break
else:
  print('Yes')

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

Solution (Python):
w=input()
dic = {
  'a': 0,
  'b': 0,
  'c': 0,
  'd': 0,
  'e': 0,
  'f': 0,
  'g': 0,
  'h': 0,
  'i': 0,
  'j': 0,
  'k': 0,
  'l': 0,
  'm': 0,
  'n': 0,
  'o': 0,
  'p': 0,
  'q': 0,
  'r': 0,
  's': 0,
  't': 0,
  'u': 0,
  'v': 0,
  'w': 0,
  'x': 0,
  'y': 0,
  'z': 0
}
for i in w:
  dic[i] +=1

flg=True
for key in dic:
  if dic[key] != 0 and dic[key] % 2 != 0:
    flg=False
print('Yes' if flg else 'No')

Solution (Python):
import collections
w=input()
W=collections.Counter(w)
for i in W.values():
    if not i%2==0:
        print('No')
        exit()
else:
    print('Yes')

Solution (Python):
w = input()
List = []
for k in range(len(w)):
  tmp = w[k]
  List.append(tmp)
num2alpha = lambda c: chr(c+96)
for i in range(1,27):
  tmp2 = List.count(num2alpha(i))
  if(tmp2 % 2 == 0):
    pass
  else:
    print("No")
    exit()
print("Yes")

Solution (Python):
from collections import defaultdict


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


if __name__ == "__main__":
    main()

Solution (Python):
from collections import Counter

s=list(input())
c = Counter(s)
ans = "Yes"
for _,i in c.items():
    if i % 2 != 0:
        ans = "No"

print(ans)

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

dic = Counter(w)


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

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

x = list()
num = list()
y = 0
for a in w:
    judge = 0
    i = 0
    while i<y:
        if a == x[i]:
            num[i] += 1
            judge = 1
            break
        i += 1
    if judge == 0:
        x.append(a)
        y += 1
        num.append(1)

i = 0
ans = "Yes"
while i<y:
    if (num[i] %2)!= 0:
        ans = "No"
    i+=1

print(ans)

Solution (Python):
from collections import Counter
w = list(input())
c = Counter(w)
for i in range(len(w)):
    if int(c[w[i]]) % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
s = input()
al = 'abcdefghijklmnopqrstuvwxyz'
tmp = [0]*26
for i in range(len(s)):
  if tmp[al.index(s[i])] == 0:
    tmp[al.index(s[i])] = 1
  else:
    tmp[al.index(s[i])] = 0
if 1 in tmp:
  print('No')
else:
  print('Yes')

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

Solution (Python):
w = sorted(input())
if len(w)%2==1:
  print("No")
else:
  ans = ("Yes")
  for i in range(1,len(w),2):
    if not w[i]==w[i-1]:
      ans = ("No")
  print(ans)

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

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

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

Solution (Python):
words = list(input())
dic = {}
for word in words:
  if word not in dic:
    dic[word] = 1
  else:
    dic[word] += 1
if all(v % 2 == 0 for v in dic.values()):
  print("Yes")
else:
  print("No")

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

Solution (Python):
s = input()
cnt = {}

for i in s:
    if i not in cnt:
        cnt[i] = 1
    else:
        cnt[i] += 1

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

Solution (Python):
w = list(input())
W = list(set(w))
cnt = [0]*len(W)

for i in w:
    cnt[W.index(i)] += 1

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

Solution (Python):
from collections import Counter
w=input()
w_list=Counter(w)
flg=1
for key in w_list:
    if w_list[key]%2!=0:
        flg=0
print("Yes" if flg else "No")

Solution (Python):
word_list = input()

word_dict = {}

for word in word_list:
    if word in word_dict:
        word_dict[word] +=1
    else:
        word_dict[word] = 1

Flag = 'Yes'
for key_count in word_dict.values():
    if key_count % 2 != 0:
        Flag = 'No'

print(Flag)

Solution (Python):
lst=list(str(input()))
temp = []
for i in range(len(lst)):
  if lst[i] not in temp:
    temp.append(lst[i])
cnt=0
for j in range(len(temp)):
  if lst.count(temp[j])%2==1:
    cnt+=1
if cnt==0:
  print("Yes")
else:
  print("No")

Solution (Python):
w = input()

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    def main():
        w=list(input())
        w.sort()
        if len(w)%2!=0:
            return 'No'
        else:
            for i in range(0,len(w)-1,2):
                if w[i]!=w[i+1]:
                    return 'No'
            return 'Yes'
    print(main())
resolve()

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    from collections import Counter
    s=input()
    s=Counter(s)
    if all (n%2==0 for n in s.values()):
        print('Yes')
    else:
        print('No')
resolve()

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    w=list(input())
    l=[0]*26
    alphabets=list(chr(ord('a')+i) for i in range(26))
    for i in w:
        l[alphabets.index(i)]+=1
    ans='Yes'
    for j in l:
        if j%2!=0:
            ans='No'
            break
    print(ans)
resolve()

Solution (Python):
from collections import Counter

s = Counter(input())

print("Yes" if all(n % 2 == 0 for n in s.values()) else "No")

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7


s=input().rstrip()
u=Counter(s)
for i in u.values():
    if i%2==0:
        continue
    else:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
w = input()
d = dict()
ans = 'Yes'
for i in w:
    if d.get(i) is None:
        d[i] = 1
    else:
        d[i] += 1
for i in d.values():
    if i % 2 == 1:
        ans = 'No'
        break
print(ans)

Solution (Python):
from collections import Counter
w = input()
c = Counter(w)
ans = True
for value in c.values():
    if value % 2 == 1:
        ans = False
        break

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

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

Solution (Python):
import copy
s = list(input())
def make1d(n):
    return [copy.deepcopy(1) for i in range(0,n)]
t = make1d(26)
for i in range(0, len(s)):
    t[ord(s[i]) - 97] = t[ord(s[i]) - 97] * (-1)
u = 0
for i in range(0, len(t)):
    u = u + t[i]
if u == 26:
    print('Yes')
else:
    print('No')

Solution (Python):
def nyu():
    S =  list(map(str,input()))
    return S

def kansu(S):

    s_flg = True

    for s in range(len(S)):
        tmp = S[s]
        if S.count(tmp) % 2 != 0:
            s_flg = False
            break

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




S = nyu()
kansu(S)

Solution (Python):
w = input()

def beauty(w):
  for c in w:
    if w.count(c) % 2 == 0:
        continue
    else:
        return('No')

  return('Yes')

print(beauty(w))

Solution (Python):
from collections import Counter

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

Solution (Python):
w = input()









counter = {}
alphabets = "abcdefghijklmnopqrstuvwxyz"

for i in alphabets:
    counter[i] = 0

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

allok = True
for i in counter:
    if counter[i] % 2 != 0:
        allok = False

if allok == True:
    print("Yes")

else:
    print("No")

Solution (Python):
w = input()
lis = []
for a in set(w):
  b = w.count(a)
  if b % 2 == 1:
    print("No")
    break
  else:
    lis.append(b)
if len(lis) == len(set(w)):
  print("Yes")

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

def main():
    w = readline().rstrip()
    c = Counter(w)
    for key, val in c.items():
        if val % 2 == 1:
            print('No')
            return
    print('Yes')


if __name__ == '__main__':
    main()

Solution (Python):
import string
alf = string.ascii_lowercase
w = input()
flg = 0
for x in alf:
    if w.count(x) % 2 == 1:
        flg = 1
        break

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

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

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

Solution (Python):
import collections

w = input()

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

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

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

Solution (Python):
import sys

w = input()
dict = {}
keys = []
value = []
for i in range(len(w)):
  if(w[i] not in keys):
    keys.append(w[i])

for i in range(len(keys)):
  value.append(w.count(keys[i]))
  if(value[i] % 2 != 0):
    print('No')
    sys.exit()

print('Yes')

Solution (Python):
from collections import Counter
w = list(input())
ans = Counter(w)
flag = True
for i in ans.values():
    if i%2!=0:
        flag = False
print('Yes' if flag else 'No')

Solution (Python):
def resolve():
    W = list(input())
    import collections
    counter = collections.Counter(W)
    for k, v in counter.items():
        if v % 2 != 0:
            print("No")
            return
    print("Yes")
        



if '__main__' == __name__:
    resolve()

Solution (Python):
from collections import Counter


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

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

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

Solution (Python):
from collections import Counter

c = Counter(input())
for q in c:
    if c[q] % 2:
        print("No")
        exit(0)
print("Yes")

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

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

Solution (Python):
from collections import Counter
w = input()
counts = Counter(w).values()
flag = True
for count in counts:
    if count % 2 != 0:
        flag = False
        break
print('Yes' if flag else 'No')

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

c = collections.Counter(w)

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

print("Yes")

Solution (Python):
s = input()
ss = list(set(s))
N = len(ss)

cnt = 0
for i in range(N):
    cnt=cnt+s.count(ss[i])%2
    
if cnt==0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]

def to_bin(x: int) -> str: return format(x, 'b') 
def to_oct(x: int) -> str: return format(x, 'o') 
def to_hex(x: int) -> str: return format(x, 'x') 
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]

from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left


def main():
    w = Counter(IS())
    for wi in w.values():
        if wi%2!=0:
            print('No')
            return None
    print('Yes')

if __name__ == '__main__':
    main()

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

Solution (Python):
s = input()
d = set([])
for c in s:
  if c not in d:
    d.add(c)
  else:
    d.remove(c)
print('Yes'if len(d)==0 else 'No')

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

Solution (Python):
s=input()
a=list(set(s))
if s.islower()!=True:
  print("No")
else:
  d=dict()
  for i in range(len(a)):
    if a[i].islower:
      d[a[i]]=s.count(a[i])
  b=[i for i in d.values()if i%2==0]
  print("Yes" if len(b)==len(a) else "No")

Solution (Python):


w=list(input())
u=set(w)
for i in u:
    if w.count(i)%2==1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
from collections import Counter

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

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

print('Yes')

Solution (Python):
import numpy as np
import sys

input = sys.stdin.readline

alp = "abcdefghijklmnopqrstuvwxyz"
alp = list(alp)

w = sorted(input())
w = w[1:]


cnt = 1
for i in range(1,len(w)):

    if w[i] ==w[i-1] :
        cnt +=1
    else:
        if cnt%2 == 1:
            print("No")
            exit()
        else:
            cnt = 1

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





w=list(ss())
a=Counter(w)
ans=0
for i in a.values():
    if i%2==0:
        ans+=1
if ans == len(list(set(w))):
    print("Yes")
else:
    print("No")

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

Solution (Python):
w = input()
alp = "abcdefghijklmnopqrstuvwxyz"
ans = 0

for i in alp:
  W = w.count(i)
  if W%2 == 0:
    pass
  else:
    ans += 1
    break
    
if ans == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
w = input()

dic ={}

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

for i in dic:
    val = dic[i]

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

print('Yes')

Solution (Python):
word = input()
word_set = set(word)

output = 'Yes'
for w in word_set:
    if (word.count(w) % 2 != 0):
        output = 'No'
        break;
        
print(output)

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