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



Sample input:
abaccaba


Sample output:
Yes

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
#kari1 = 'abaccaba' #Yes
kari1 = 'hthth' #No
in1 = kari1
"""
in1 = input()

mydict = {}

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

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

print(RC)

Submission status: Accepted

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

ans = "Yes"

W = Counter(w)

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

print(ans)

Submission status: Accepted

Solution code:
w = input()

import collections

W = collections.Counter(list(w))

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

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

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

Solution code:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key



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


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

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

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

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

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



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

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

    # 出力
    print(yn[not judge::2])




# EOF

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

# a ~ z までの辞書を生成(valueの初期値は0)
d = {chr(i): 50 for i in range(97, 97+26)}

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

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

print(ans)

Submission status: Accepted

Solution code:
import collections

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

        w = w.replace(find, '')

    print(ans)


if __name__ == '__main__':
    problemB()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
evenCount = 0

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

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

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


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

Submission status: Accepted

Solution code:
w=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w=input()
a=list(w)
s=set(a)
flag=0
for i in s:
  if a.count(i)%2!=0:
    print("No")
    flag=1
    break
if flag==0:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

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

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

Submission status: Accepted

Solution code:
w = input()
s = 97

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:

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

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

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B
w = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

else:
    print("No")

Submission status: Accepted

Solution code:
#ABC044.B
w = input()
L = list(w)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

counter = [0] * 26

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

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

print(flag)

Submission status: Accepted

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

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

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

    print('Yes')

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

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

Submission status: Accepted

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

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


#ascii a->97 z->122

Submission status: Accepted

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

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

Submission status: Accepted

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

    W.sort()

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

    print("Yes")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter
readline = sys.stdin.buffer.readline

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

c = Counter(s)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
W = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print ("Yes")

Submission status: Accepted

Solution code:
w = input()

hash = {}

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
w = list(str(input()))
n = len(w)
alph = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
w = input()

d = {}

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
from collections import defaultdict
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


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

    return


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'}
str = input()
ans = 'Yes'
for alpha in list:
  cnt = str.count(alpha)
  if cnt % 2 == 1:
    ans = 'No'
    break
    
print(ans)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc044/tasks/abc044_b

w = input()

w_dic = {}

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

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

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

Submission status: Accepted

Solution code:
def count_dict(mystring):
    d = {}
# count occurances of character
    for w in mystring: 
        d[w] = mystring.count(w)
    return d
    
w = str(input())

values = count_dict(w).values()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = input().strip()

W_dic={ w:0 for w in s }

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

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
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()

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
#!/use/bin/env python3

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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
#B - 美しい文字列

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')

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


YES = "Yes"  # type: str
NO = "No"  # type: str


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)  # type: str
    solve(w)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
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')