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:
#coding:utf-8
w = input()

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

print('Yes')

Submission status: Accepted

Solution code:
w=input()

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

Submission status: Accepted

Solution code:

from collections import Counter

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

print("Yes")

Submission status: Accepted

Solution code:
import collections
w = input()
W = collections.Counter(w)

bl = True
v = W.values()
for i in v:
    if i&1:
        bl = False

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

Submission status: Accepted

Solution code:
w = str(input())
H = True
if len(w)%2!=0:
  H = False
else:
  l=[]
  for i in range(len(w)):
    l += w[i]
  l.sort()
  for j in range(0,len(w),2):
    if l[j]!=l[j+1]:
      H =False
print('Yes' if H else 'No')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

check = list(set(w))
for x in check:
   if (w.count(x) % 2 == 1):
      print('No')
      exit()

print('Yes')

Submission status: Accepted

Solution code:
w = list(map(str, input()))
flg = 0
w.sort()
if len(w) % 2 == 1:
    flg += 1

else:
    for i in range(0, len(w)-1, 2):
        if w[i] != w[i+1]:
            flg += 1
            break

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

Submission status: Accepted

Solution code:
import sys

w = list(input())


for i in range(ord('a'), ord('z')+1, 1):
    s = chr(i)

    if w.count(s)%2!=0:
        print("No")
        sys.exit()

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#N, L = map(int, input().split())
w = str(input())

if len(w)%2 == 1 :
  print ("No")
  exit()
else :
  dict = {}
  for i in range(len(w)) :
    if w[i] not in dict :
      dict[w[i]] = 1
    else :
      dict[w[i]] += 1

list = list(dict.values())
for j in range(len(list)) :
  if list[j] % 2 != 0 :
    print ("No")
    exit()
print ("Yes")

Submission status: Accepted

Solution code:
w = input()

for j in [chr(i) for i in range(97, 97+26)]:
   if w.count(j) % 2 != 0:
      print('No')
      import sys
      sys.exit()
print('Yes')

Submission status: Accepted

Solution code:
def solve(s: str) -> str:
    counts = {}
    for c in s:
        if not c in counts:
            counts[c] = 0
        counts[c] += 1

    for n in counts.values():
        if n % 2 == 1:
            return 'No'
    else:
        return 'Yes'

s = input()
print(solve(s))

Submission status: Accepted

Solution code:
import collections
w = input()
c = collections.Counter(w)
for x in c.values():
    if x % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
import math
import fractions

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

Submission status: Accepted

Solution code:
w = input()

A=[]
for x in w:
	if x not in A:	A.append(x)
	else:	A.remove(x)

print('Yes' if len(A)==0 else 'No')

Submission status: Accepted

Solution code:
w = input()
l = [0]*26

for x in w:
    l[ord(x)-97] += 1

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

print('Yes')

Submission status: Accepted

Solution code:
w = str(input())

moji = set(w)

kaisu = []

for i in moji:
    kaisu.append(w.count(i))

if all([x % 2==0 for x in kaisu]):
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
import sys


def main(argv=sys.argv):

    char_list = input()

    char_set = set(char_list)

    for char_ in char_set:

        if char_list.count(char_) % 2 != 0:

            print('No')

            return 0

    print('Yes')

    return 0


if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
if w != w.lower():
  print('No')
else:
  a = []
  for x in w:
    if x in a:
      a.remove(x)
    else:
      a.append(x)
  print('Yes' if len(a)==0 else 'No')

Submission status: Accepted

Solution code:
s=list(input())
import collections as c
d=c.Counter(s)
dd=d.values()
fl=0
for i in dd:
    if i%2:
        fl=1
        print("No")
        break
if not fl:
    print("Yes")

Submission status: Accepted

Solution code:
w = input()

def func(w):
    for i in set(w):
        if w.count(i) % 2 != 0:
            return "No"
    return "Yes"

print(func(w))

Submission status: Accepted

Solution code:
import collections
l = [i for i in input()]
c = collections.Counter(l)
check = 0
for i in c.values():
  if i % 2:
    check += 1
    print("No")
    break
if check == 0:
  print("Yes")

Submission status: Accepted

Solution code:
from string import ascii_lowercase
s = input()
r = 'Yes'
for l in ascii_lowercase:
    if s.count(l) % 2 == 1:
        r = 'No'
        break
print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

c = Counter(w)

flag = True

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

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

Submission status: Accepted

Solution code:
w = input()
from collections import Counter
c = Counter(w)
f = True
for k in c.keys():
    if c[k] % 2 == 1:
        f = False
if f:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:

w = list(input())
count = 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

a = []
for i in w:
    a.append(i)

a = set(a)

for i in a:
    count = 0
    for j in w:
        if j == i:
            count += 1
    if count % 2 == 0:
        continue
    else:
        print('No')
        exit()

print('Yes')

Submission status: Accepted

Solution code:
s=list(input())
s.sort()
if len(s)%2==1 and s[0]==s[-1]:
  print("No")
  
else:
  ans=0
  for i in range(len(s)-1):
    if s[i]==s[i+1]:
      ans+=1
    else:
      if ans%2==0:
        print("No")
        break
      else:
        ans=0
        pass
  else:
    print("Yes")

Submission status: Accepted

Solution code:
words=input()
s=""
flag=0
for word in words:
    if words.count(word)%2==1:
        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):
  k=chr(i)
  if w.count(k) %2!=0:
    print("No");exit()
print("Yes")

Submission status: Accepted

Solution code:
a = str(input())
b =sorted(list(set(a)))
c = 0
for i in b:
  if a.count(i) % 2 == 0:
    c += 0
  else:
    c += 1

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

Submission status: Accepted

Solution code:
word = input()
word_list = []
for i in range(len(word)):
    word_list.append(word[i])
many_list = []
def how_many():
    how = 0
    first = word_list[0]
    while(True):
        try:
            word_list.remove(first)
            how +=1
        except:
            break
    many_list.append(how)
while(True):
    try:
        how_many()
    except:
        break

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

if 1 in many_list:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys
from collections import Counter

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

def main():
    for c in Counter(s).values():
        if c & 1:
            return 'No'

    return 'Yes'

if __name__ == '__main__':
    ans = main()
    print(ans)

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

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

Submission status: Accepted

Solution code:
import collections
w = input()
w_counted = collections.Counter(w)
# print(len(w))
for v in w_counted.values():
    # print(v)
    if v % 2 != 0:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
w = input()
f = [False]*26

for c in w:
    f[ord(c)-ord('a')] = not f[ord(c)-ord('a')]
for b in f:
    if b:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print('Yes')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
w = list(input())
alp = list("qwertyuioplkjhgfdsazxcvbnm")
data = [0]*len(alp)
for item in w:
    key = alp.index(item)
    data[key] += 1

flag = 0
for num in data:
    if num%2 != 0:
        flag = 1
        break

print(["Yes","No"][flag])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import itertools#これは色々使える組み込み関数みたいなやつ
import math#数学的計算はこれでいける。普通に0.5乗しても計算可能
w=input()
#N = 3
#x=[]
#y=[]
#t, x, y = [0]*(N+1), [0]*(N+1), [0]*(N+1)#N+1個の空のリストを作成(原点を入れて##るから一つ増える)
#delta_t=0
#delta_x=0
#delta_y=0
#l=0
#t[0],x[0],y[0]=[0, 0, 0]
#とりあえず入力までは完成した．
#for i in range(N):
# t[i+1], x[i+1], y[i+1] = map(int, input().split())
w_len=len(w)
w_list=list(w)
#print(len(w_list))
#print(w_list)
i=0
j=0
k=0
alphabet="abcdefghijklmnopqrstuvwxyz"
alphabet_list=list(alphabet)
#print(alphabet_list)
for i in range(26):
 k=0
 for j in range(w_len):
    #print(i)
    #print(j)
    if w_list[j]==alphabet_list[i]:
        k=k+1
    else:
        pass
 #print(k)
 if k%2 ==0:
     pass
 else:
     print("No")
     sys.exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
li = list('abcdefghijklmnopqrstuvwxyz')

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

Submission status: Accepted

Solution code:
import sys
w = input()

# すべての文字が偶数回出現する

# 入力が１文字の時、wは美しくない
if len(w) == 1:
    print("No")
    sys.exit()
    
# 文字数分ループする
for i in range(len(w)-1):
    # 1文字目の文字が偶数回出現するなら継続。奇数回なら終了
    if w.count(w[i])%2==0:
        continue
    else:
        print("No")
        sys.exit()

# 途中で終了しなかったら、wは美しい
print("Yes")

Submission status: Accepted

Solution code:
import collections
w = list(input())
cnt_w = collections.Counter(w)
ans = "Yes"
for v in cnt_w.values():
  if v % 2 != 0:
    ans = "No"
print(ans)

Submission status: Accepted

Solution code:
w = str(input())
count_list = []
result = ""
for i in range(97, 123) :
  count_list.append(w.count(chr(i)))
for i in count_list :
  if i % 2 == 0 :
    result = "Yes"
  else:
    result = "No"
    break
print(result)

Submission status: Accepted

Solution code:
w = input()
freq = {}
for i in w:
    if i in freq:
        freq[i] += 1
    else:
        freq[i] = 1
for val in freq.values():
    if val % 2 == 1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
S = input()
A = set([i for i in S])
for j in A:
  if S.count(j) % 2 == 1:
    print("No")
    sys.exit()
  else:
    None
print("Yes")

Submission status: Accepted

Solution code:
import collections

w = input()

c = collections.Counter(w)

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

print(ans)

Submission status: Accepted

Solution code:
W = input()

cnt = {}

for w in W:
    if w not in cnt.keys():
        cnt[w] = 1
    else:
        cnt[w] += 1

ans = 'Yes'
for v in cnt.values():
    if v % 2 == 1:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys

W = list(input())

for i in W:
    if W.count(i) % 2 == 1:
        print('No')
        sys.exit()
    W = [j for j in W if j != i]

print('Yes')

Submission status: Accepted

Solution code:
import collections
s = list(input())
d = collections.Counter(s)
ans = "Yes"
for v in d.values():
    if v%2==1:
        ans="No"
        break
print(ans)

Submission status: Accepted

Solution code:
from collections import Counter
s=list(input())
c=Counter(s)
if all(x%2==0 for x in c.values()):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w = input()
alfa = [chr(i) for i in range(97, 97+26)]
s = [0]*len(alfa)
for i in range(len(w)):
    for j in range(len(alfa)):
        if w[i]==alfa[j]:
            s[j]+=1

ans = True
for i in range(len(s)):
    if s[i]%2 != 0:
        ans = False
if(ans):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()
a = set(s)

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

Submission status: Accepted

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

c = collections.Counter(w)
flag=True
for v in c.values():
    if v%2!=0:
        flag=False

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

Submission status: Accepted

Solution code:
_w = list(input())

W = []

for w in _w:
  if w not in W:
    W.append(w)

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

print('Yes')

Submission status: Accepted

Solution code:
w = input()

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

print('Yes')

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

li = list('abcdefghijklmnopqrstuvwxyz')
cnt = [0 for i in range(26)]

w = list(input())


for i in range(len(w)):
    for j in range(26):
        if li[j] == w[i]:
            cnt[j] += 1
            break

for i in range(26):
    if cnt[i]%2 == 0 and i!=25:
        continue 
    elif cnt[i]%2 != 0:
        print("No")
        break
    else:
        print("Yes")
        break

Submission status: Accepted

Solution code:
a=input()
l=[]
count=0
for i in range(len(a)):
    l.append(a[i])
l.sort()
for i in range(len(a)):
    
    if(l.count(l[i])%2!=0):
        count=1
        print("No")
        break

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

Submission status: Accepted

Solution code:


if __name__ == '__main__':
    w=input()
    w_set=set(w)
    flag=True
    for s in w_set:
        if w.count(s)%2!=0:
            flag=False

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

Submission status: Accepted

Solution code:
s = input()
a = set(s)

for i in a:
  if s.count(i) % 2 == 1:
    print('No')
    quit()
print('Yes')

Submission status: Accepted

Solution code:
w = input()

ans = "Yes"

for s in w:
    if w.count(s) % 2 == 1:
        ans = "No"
        break

print(ans)

Submission status: Accepted

Solution code:
w=input()
A=list('abcdefghijklmnopqrstuvwxyz')
for i in A:
    if w.count(i)%2==0:
        continue
    else:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
from sys import stdin
from itertools import groupby

s = stdin.readline().rstrip()
s = [str(i) for i in s]

s.sort()

lin = []
for key, value in groupby(s):
    lin.append(len(list(value)))

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

print("Yes")

Submission status: Accepted

Solution code:
# a〜z
l=['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=input()

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

# 出力
print('Yes')

Submission status: Accepted

Solution code:

if __name__ == '__main__':
    string=input()
    string_set=set(string)
    flag=True
    for s in string_set:
        if string.count(s)%2==0:
            continue
        else:
            flag=False
    if flag:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

from collections import Counter
counter = Counter(S)

cnt=0
for i in S:
    if counter[i]%2!=0:
        cnt+=1
    else:
        cnt+=0
        
if cnt>=1:
    print('No')

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

Submission status: Accepted

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

ans = 0

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

print('Yes' if ans==len(w) else 'No')

Submission status: Accepted

Solution code:
w = input()

w_list = list(w)

for i in set(w_list):

    if int(w_list.count(i)) % 2 == 1:

        print('No')
        break

else:
    print('Yes')

Submission status: Accepted

Solution code:
w = input()

dict = {}
flag = 0

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

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

for v in dict.values():
    if v % 2 == 1:
        flag = 1

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

Submission status: Accepted

Solution code:
import collections

w = input()
c = collections.Counter(w)
for k, v in c.items():
    if v % 2 == 1:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
w = input()
freq = {}

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

if len(list(filter(lambda x: x%2==0, freq.values()))) == len(freq.keys()):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

w = input()
cnt = Counter(w)

is_beautiful = True

for c in cnt.values():
    if c % 2 != 0:
        is_beautiful = False

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

Submission status: Accepted

Solution code:
w = str(input())
count = int()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def count(words):
    for word in words:
        if word in count_dict:
            count_dict[word] += 1
        else:
            count_dict[word] = 1

def even_number(count_dict):
    for key in count_dict:
        if count_dict[key] % 2 != 0:
            return('No')
    return('Yes')

if __name__ == '__main__':
    words = input()
    count_dict = {}

    count(words)
    ans = even_number(count_dict)
    print(ans)

Submission status: Accepted

Solution code:
w = input()


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

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
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
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    d = defaultdict(int)
    for s in S:
        d[s]+=1
    for v in d.values():
        if v&1:
            print("No")
            exit()
    print("Yes")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np

w = input()
anal = np.array([])

for i in range(ord('a'),ord('z')+1):
    anal = np.append(anal,w.count(chr(i)))
if np.all(anal % 2 == 0):
    #ans = np.sum(anal)
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from string import ascii_lowercase

str = input()
for i in ascii_lowercase:
	if (str.count(i) % 2 == 1):
		print("No")
		exit()
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

S = input()
C = Counter(S)
ans = "Yes"
for c in C.values():
	if c % 2 == 1:
		ans = 'No'
		break
print(ans)

Submission status: Accepted

Solution code:
import collections

def main():
    w = input()
    c = collections.Counter(w)
    ans = 'Yes'

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
w = input()
dic = {}
for i in w:
    if(i in dic) == False:
        dic[i] = 1
    else:
        dic[i] += 1
ans = True
for key,value in dic.items():
    if(value %2 == 0):
        continue
    else:
        ans = False
        break
if(ans):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
##### 解けた #####

import numpy as np

w=np.asarray(list(input()))
NGflag=False

for u in np.unique(w): # 各ユニークワードについて
    if len(np.where(w==u)[0])%2==1: # 奇数個の場合、ダメ
        NGflag=True

if NGflag==True: # ダメな場合
    print("No")
else: # よい場合
    print("Yes")

Submission status: Accepted

Solution code:
w = sorted(input())
n = len(w)
a = 0
t = list()
for i in range(n - 1):
    if w[i] == w[i + 1]:
        a += 1
    else:
        t.append(a)
        a = 0
t.append(a)
for i in range(len(t)):
    if t[i] % 2 == 0:
        a = -1
if a == -1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

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

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:
w = input()
for i in set(w):
  if w.count(i)%2:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

w = input()
a = Counter(w)
for k, v in a.items():
    if v % 2:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
import collections
w=input()
c=collections.Counter(w)
for moji,count in c.items():
    if(count%2 != 0):
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter as C
A = C([a for a in input()]).values()

for a in A:
    if a % 2:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = str(input())
cnt = [0] * 26
for i in range(len(w)):
    cnt[ord(w[i]) - ord('a')] += 1

ans = 'Yes'
for i in range(26):
    if cnt[i] % 2 == 1:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

Solution code:
w = input()
letterlist = ["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"]
numletter = []
for i in range(len(letterlist)) :
    numletter += [w.count(letterlist[i])]
i = 0
while i < len(numletter) :
    num = numletter[i]
    if num % 2 == 1 :
        print("No")
        break
    i += 1
else :
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = list(str(input()))
ans = 'Yes'

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

print(ans)

Submission status: Accepted

Solution code:
word = input()

Rslt = 'Yes'
for letter in range(len(word)):
  if word.count(word[letter]) % 2 != 0:
    Rslt = 'No'
    break

print(Rslt)

Submission status: Accepted

Solution code:
w = input()
lst = [0] * 26

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

sum = 0
for i in range(26):
    lst[i] %= 2
    sum += lst[i]

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

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

Solution code:
w = input()
Data = {}
for c in w:
    if c in Data.keys():
        Data[c] += 1
    else:
        Data[c] = 1
ans = 'Yes'
for v in Data.values():
    if v % 2 == 1:
        ans = 'No'
        break
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s=list(input())
ans='Yes'
for i in range(len(s)):
    if s.count(s[i])%2!=0:
        ans='No'
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline

count = [0] * 26
w = input().rstrip()
for ch in w:
    count[ord(ch) - ord("a")] += 1
ok = True
for item in count:
    if item % 2 == 1:
        ok = False
print("Yes" if ok else "No")

Submission status: Accepted

Solution code:
s=str(input())
x=["a","b","c","d","e","f","g","h","i","j","k","l","n","m","o","p","q","r","s","t","u","v","w","x","y","z"]
c=0
for i in range(len(x)):
    S=s.count(x[i])
    if S%2!=0:
        print('No')
        c=1
        break
if c==0:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

w_set = set(list(w))

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

Submission status: Accepted

Solution code:
w = input()

s = set(w)

flag = True
for a in s:
    if w.count(a)%2==0:
        pass
    else:
        flag = False
        break

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

Submission status: Accepted

Solution code:
w = input()
W = []
for i in range(len(w)):
    x = ord(w[i]) - 97
    W.append(x)
ans = 'Yes'
if len(w) % 2 == 1:
    ans = 'No'
else:
    for i in range(26):
        if W.count(i) % 2 == 1:
            ans = 'No'
            break
print(ans)

Submission status: Accepted

Solution code:
def examB():
    w = S()
    char = [0]*26
#    print(ord(w[0]))
    for s in w:
        char[ord(s)-97] +=1
    ans = "Yes"
    for i in char:
        if i%2==1:
            ans = "No"
    print(ans)

import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()