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: Wrong Answer

Solution code:
w=input()
p=w
s=''
while True:
	s=w[0]
	w=p
	if w.count(s)%2==1:
		print('No')
		break
	p=w.replace(s,'')
	if w:
		print('Yes')
		break

Submission status: Wrong Answer

Solution code:
w=input()
s=''
while True:
	s=w[0]
	if w.count(s)%2==1:
		print('No')
		break
	w.replace(s,'')
	if w:
		print('Yes')
		break

Submission status: Wrong Answer

Solution code:
w=str(input())
s=''
while True:
	s=w[0]
	if w.count(s)%2==1:
		print('No')
		break
	w.replace(s,'')
	if w:
		print('Yes')
		break

Submission status: Wrong Answer

Solution code:
def q69(w):
    word_count = {}
    for i in w:
        if i in word_count:
            word_count[i] += 1
        else:
            word_count[i] = 1

    for i in word_count.values():
        if i // 2 != 0:
            return 'No'
        
    return 'Yes'
            
w = list(input())
print(q69(w))

Submission status: Wrong Answer

Solution code:
def q69(w):
    word_count = {}
    for i in w:
        if i in word_count:
            word_count[i] += 1
        else:
            word_count[i] = 1

    for i in word_count.values():
        if i // 2 == 0:
            print(i)
        else:
            return 'No'
    return 'Yes'
            
w = list(input())
print(q69(w))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
s=input()
s=sorted(s)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w=input()
for i in range(97,123):
    cnt=0
    for j in range(len(w)):
        w[j]==chr(i)
        cnt+=1
    if cnt%2==1:
        print("No")
        exit()
print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

w = input()

while w.islower():

    length = len(w)
    if length >= 100:
        sys.exit()

    for n_alpha in "abcdefghijklmnopqrstuvwxyz":
        count_alpha = w.count(n_alpha)
        if count_alpha % 2 == 1:
            print('No')
            sys.exit()

    print('Yes')
    sys.exit()

sys.exit()

Submission status: Wrong Answer

Solution code:
import sys

w = input()

length = len(w)
if length >= 100:
    sys.exit()

for n_alpha in "abcdefghijklmnopqrstuvwxyz":
    if w=='':
        sys.exit()
    count_alpha = w.count(n_alpha)

    if count_alpha % 2 == 1:
        print('No')
        break

if count_alpha % 2 ==0:
    print('Yes')

Submission status: Wrong Answer

Solution code:
w = input()
dic = {}
for i in range(len(w)):
    dic[w[i]] = w.count(w[i])

a = list(dic.values())
a = [n%2 for n in a]
print("Yes" if all(a)==0 else "No")

Submission status: Wrong Answer

Solution code:
#インポート
import sys

#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

w = list(IS())
set_w = set(w)
for s in set_w:
    if w.count(s)%2 != 0:
        print("NO")
        break
else:
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter

w = input()

char_counter = Counter()

for c in w:
  char_counter[c] += 1
  
print(char_counter)

is_beautiful = "Yes"
for c in char_counter.most_common():
  if c[1] % 2 == 1:
    is_beautiful = "No"

print(is_beautiful)

Submission status: Wrong Answer

Solution code:
from collections import Counter

w = input()

char_counter = Counter()

for c in w:
  char_counter[c] += 1
  
print(char_counter)

is_beautiful = "YES"
for c in char_counter.most_common():
  if c[1] % 2 == 1:
    is_beautiful = "NO"

print(is_beautiful)

Submission status: Wrong Answer

Solution code:
def main():
  s = raw_input()
  memo = {}
  for c in s:
    if c not in memo:
      memo[c] = 0
    memo[c] += 1
  
  result = True
  for x in memo.values():
    if x % 2 > 0:
      result = False
      break
  print("YES" if result else "NO")

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w=input()
for i in range(len(w)):
    if w.count(w[i])%2!=0:
        print("NO")
print("YES")

Submission status: Wrong Answer

Solution code:
w = list(input())
print("Yes") if len(w) == len(list(set(w)))*2 else print("No")

Submission status: Wrong Answer

Solution code:
w = input()
new_w = list(set(w))
#print(new_w)
#print(w)

count = 0
for char in new_w:
  n = w.count(char)
  count += n
#print(count)
if count % 2 == 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a=sorted(input())
b=0
for i in range(len(a)-1):
  if i%2==0 and a[i]!=a[i+1]:
    b=1
print("Yes" if b==0 else "No")

Submission status: Wrong Answer

Solution code:
w=sorted(list(input()))
if len(w)==1:
    print("No")
else:
    for i in range(len(w)//2):
        if w[2*i]!=w[2*i+1]:
            print("No")
            break
        else:
            print("Yes")
#breakしてない時はelse文実行くそ有能

Submission status: Wrong Answer

Solution code:
w=sorted(list(input()))
if len(w)==1:
    print("No")
for i in range(len(w)//2):
    if w[2*i]!=w[2*i+1]:
        print("No")
        break
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
w=sorted(list(input()))
for i in range(len(w)//2):
    if w[2*i]!=w[2*i+1]:
        print("No")
        break
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
r=input()
a={}
for i in "ABCDEF":
  a[i]=0

for i in r:
  if i in a:
    a[i]+=1
print(str(a["A"])+" "+str(a["B"])+" "+str(a["C"])+" "+str(a["D"])+" "+str(a["E"])+" "+str(a["F"]))

Submission status: Wrong Answer

Solution code:
from collections import Counter

s = input()

c = Counter(list(s))

for word , cnt in c.most_common():
	if cnt % 2 !=0:
		print('NO')
		exit()
print('YES')

Submission status: Wrong Answer

Solution code:
st = input()

for char in st:
    if st.count(char) %2 !=0:
        print("No")
        break
    else:
        st = st.replace(char,"")
        if len(st) == 0:
          print("YES")
          break

Submission status: Wrong Answer

Solution code:
st = input()

for char in st:
    if len(st) == 0:
        print("YES")
        break
    if st.count(char) %2 !=0:
        print("No")
        break
    else:
        st = st.replace(char,"")
        continue

Submission status: Wrong Answer

Solution code:
st = "abcfcabf"

for char in st:
    print(len(st))
    if len(st) == 0:
        print("Yes")
        break
    if st.count(char) %2 !=0:
        print("No")
        break
    else:
        print(st)
        st = st.replace(char,"")
        continue

Submission status: Wrong Answer

Solution code:
st = "abcfcabf"

for char in st:
    print(len(st))
    if len(st) == 0:
        print("YES")
        break
    if st.count(char) %2 !=0:
        print("No")
        break
    else:
        print(st)
        st = st.replace(char,"")
        continue

Submission status: Wrong Answer

Solution code:
w = input()
retw = "YES"
for i in range(len(w)):
    if w.count(w[i])%2 != 0:
        retw = "NO"
        break
print(retw)

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
w = []
x = []
for i in range(n):
  w.append(s[i])
  if i % 2 == 0:
    x.append(s[i])
y = x + x
w.sort()
y.sort()
if w == y:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
w = input()
for i in w:
    if w.count(i) & 2 == 1:
        print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
w = input()
f=0
def beautiful(w):
    for i in w:
        if w.count(i)%2 != 0: 
            return "NO"
    return "YES"
print(beautiful(w))

Submission status: Wrong Answer

Solution code:
w = input()
f=0
for i in w:
    if w.count(i)%2 != 0: 
        f=0
    elif i == w[-1]: f=1
print("YES" if f ==1 else "NO")

Submission status: Wrong Answer

Solution code:
N = raw_input()
flag = True


for i in range(ord('a'), ord('z')+1):
    if int(N.count(chr(i))) %2 == 1 :
        flag = False
        break
if flag:
    print "YES"
else:
    print "NO"

Submission status: Wrong Answer

Solution code:
N = list(raw_input())
flag = True

for i in range(ord('a'), ord('z')+1):
    if int(N.count(chr(i))) %2 == 1 :
        flag = False
        print "No"
        break
if flag:
    print "YES"

Submission status: Wrong Answer

Solution code:
w = input()

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

Submission status: Wrong Answer

Solution code:
w = input()

w_set = set( w )

print( w_set )

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

print( "Yes" )

Submission status: Wrong Answer

Solution code:
w = input()

w_set = set( w )

print( w_set )

for each_ch in w_set:
	print( str( each_ch ) + " " + str( w.count( each_ch ) ) )
	if w.count( each_ch ) % 2 == 1:
		print( "No" )
		exit()

print( "Yes" )

Submission status: Wrong Answer

Solution code:
w = input()

w_set = set( w )

for each_ch in w_set:
	if w.count( each_ch ) % 2 == 1:
		print( "NO" )
		exit()

print( "YES" )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w=input()
w_list=list(w)
w_unique=list(set(w_list))
c=0
for x in w_unique:
    if w_list.count(x)%2==0:
        c=c
    else:
        c+=1
        
if c==0:
    print('YES')
    
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
#ABC044B

import sys
w = input()
l = len(w)
sig = 0

for i in range(l):
    if w.count(w[i])%2 !=0:
        sig = 1
        break

if sig == 1:
    print("No")
print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w=input()
l=[]
c=0
for i in w:
  l.append(i)
l.sort()
for k in range(len(l)-1):
  if l[k]==l[k+1]:
    c+=1
  elif c%2==1:
    c=0
    continue
  else:
    print('No')
    exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
w=input()
l=[]
c=0
for i in w:
  l.append(i)
l.sort()
for k in range(len(l)-1):
  if l[k]==l[k+1]:
    c+=1
  elif c%2==1:
    c=0
    continue
  else:
    print('NO')
    exit()
print('YES')

Submission status: Wrong Answer

Solution code:
a = input()
ans = "Yes"

char_list = list(a)
doubli = list(set(char_list))
#print(doubli)

for x in doubli:
    #print(char_list.count(x))
    if(char_list.count(x) == 1):
        ans = "No"
        break

Submission status: Wrong Answer

Solution code:
import sys
W = input()
alpha = ["a","b","c","d","e","f","g","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
for num in alpha:
    if W.count(num) %2 != 0:
        print("No")
        sys.exit()
print("yes")

Submission status: Wrong Answer

Solution code:
w = input()
w = list(w)
w.sort()
isBeautiful = True
for i in range(1, len(w)):

    if w[i-1] == w[i]:
        continue
    if i % 2 != 0:
        isBeautiful = False

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    k = II()
    x = II()
    y = II()
    ans = 0
    for i in range(n):
        if i >= k:
            ans += y
        else:
            ans += x
    print(ans)
    return

#B
def B():
    w = S()
    d = defaultdict(int)
    for s in w:
        d[s] += 1
    for di in d.values():
        if di % 2:
            continue
        print("No")
        return
    print("Yes")
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    k = II()
    x = II()
    y = II()
    ans = 0
    for i in range(n):
        if i >= k:
            ans += y
        else:
            ans += x
    print(ans)
    return

#B
def B():
    w = S()
    d = defaultdict(int)
    for s in w:
        d[s] += 1
    for di in d.values():
        if di % 2:
            continue
        print("No")
        break
    print("Yes")
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Wrong Answer

Solution code:
s = list(input())
flag = "YES"

for x in s:
    if s.count(x) % 2 != 0:
        flag = "NO"

print(flag)

Submission status: Wrong Answer

Solution code:
s = input()

a = ''
count = 0
for x in s:
    for y in s:
        if x == y:
            count += 1
    if count % 2 != 0:
        print('NO')
        break

if count % 2 == 0:
    print('YES')

Submission status: Wrong Answer

Solution code:
w = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
s = input()
ans = {'a':0,'b':0,'c':0}
for i in s:
	if i in ans:
		ans[i] +=1
	else:
		print('No')
		sys.exit()
print('Yes' if (ans['a']%2==0 and ans['a']%2==0 and ans['a']%2==0) else 'No')

Submission status: Wrong Answer

Solution code:
import sys
s = input()
ans = {'a':0,'b':0,'c':0}
for i in s:
	if i in ans:
		ans[i] +=1
	else:
		print('NO')
		sys.exit()
print('Yes' if (ans['a']%2==0 and ans['a']%2==0 and ans['a']%2==0) else 'No')

Submission status: Wrong Answer

Solution code:
import sys
s = input()
ans = {'a':0,'b':0,'c':0}
for i in s:
	if i in ans:
		ans[i] +=1
	else:
		print('NO')
		sys.exit()
print('YES' if (ans['a']%2==0 and ans['a']%2==0 and ans['a']%2==0) else 'NO')

Submission status: Wrong Answer

Solution code:
from collections import Counter
a = input()
b = Counter(a)
c = 0

for i in b.values():
  if i%2!=0:
    c = 1
    break
else:
  if c==0:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

ans = "Yes"

lst_A = list(input())

lst_A.sort()

if len(lst_A) % 2 == 1:
    ans = "No"

else:
    for i in range(len(lst_A)-1,2):
        if lst_A[i] != lst_A[i+1]:
            ans = "No"

print(ans)

Submission status: Wrong Answer

Solution code:
w = input()
w = list(w)
flg = False
for i in range(len(w)):
    if w.count(w[i]) % 2 == 0:
        flg = True
    else:
        flg = False

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

Submission status: Wrong Answer

Solution code:
w = input()
w = list(w)
flg = True
for i in range(len(w)):
    if w.count(w[i]) % 2 == 0:
        flg = True
    else:
        flg = False

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

Submission status: Wrong Answer

Solution code:
w = input()

from collections import Counter
C = Counter()
ans="Yes"
for w_i in w:
  C[w_i]+=1
  if C[w_i]%2==1:
    ans="No"
  else:
    ans="Yes"
print(ans)

Submission status: Wrong Answer

Solution code:
w = input()

from collections import Counter
C = Counter()
ans=None
for w_i in w:
  C[w_i]+=1
  if C[w_i]%2==1:
    ans="No"
  else:
    ans="Yes"
print(ans)

Submission status: Wrong Answer

Solution code:
w = input()

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

Submission status: Wrong Answer

Solution code:
w = input()

cnt = 0
for i in range(ord('a'),ord('z')+1):
  if w.count(str(i))%2==1:
    print('No')
    exit()
else: print('Yes')

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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

    print(ans)

Submission status: Wrong Answer

Solution code:
string = input()
if len(string) % 2 == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()
answer="Yes"
while len(s)>0:
    if s.count(s[0])%2==1:
        answer="No"
        break
    s=s.strip(s[0])
print(answer)

Submission status: Wrong Answer

Solution code:
s=input()
answer="Yes"
while len(s)>0:
    if s.count(s[0])%2==1:
        answer="No"
    s=s.strip(s[0])
print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import itertools
import sys
import math
from functools import lru_cache

# 1整数
# n = int(input())

# 空白区切り2変数
from queue import Queue
from operator import mul
from functools import reduce
from queue import Queue
from operator import mul
from functools import reduce
from functools import lru_cache

input = sys.stdin.readline

# N個整数
# a, b, c = list(map(int, input().split()))

# 1整数
# n = int(input())

# 空白区切りリスト整数
# b = list(map(int, input().split()))

# 空白区切り文字列
# t, d = input().split()
s=list(input())

m = {}

for c in s:
    if c in m:
        m[c] = m[c] + 1
    else:
        m[c] = 1
#print(m)
for k in m:
    if m[k] % 2 == 1:
        print("No")
        exit(0)
print("Yes")

Submission status: Wrong Answer

Solution code:
w = sorted(input())
ret = 'Yes'
for i in range(0, len(w)-1, 2):
    if w[i] != w[i+1]:
        ret = 'No'
        break
print(ret)

Submission status: Wrong Answer

Solution code:
a = list(input())
a = sorted(a)
def count(a):
    b =[]
    for i in range(0,len(a)-2):
        if a[i] != a[i+1]:
            b.append( i+1)
    return b

b = count(a)
b.append(len(a))

for i in reversed(range(0,len(b)-1)):
    b[i+1] =b[i+1] - b[i]

d = 0
for i in range(0,len(b)):
    d = d +b[i]%2

if d ==0:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
#B問題
w = input()
a = w.count("a") 
b = w.count("b")
c = w.count("c")
d = w.count("d")
e = w.count("e")
f = w.count("f") 
g = w.count("g")
h = w.count("h")
i = w.count("i") 
j = w.count("j") 
k = w.count("k")
l= w.count("l")
m = w.count("m") 
n = w.count("n")
o = w.count("o") 
p = w.count("p") 
q = w.count("q") 
r = w.count("r") 
s = w.count("s")
t = w.count("t") 
u = w.count("u")
v = w.count("v")
W = w.count("w")
x = w.count("x") 
y= w.count("y") 
z = w.count("z")

if(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) %2 == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys

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

ww = sorted(w)
frag = True
for i in range(0,len(ww),2):
    if ww[i]!=ww[i+1]:
        flag = False
if frag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
w=list(input())
s=list(set(w))
k=len(s)
b=0
for i in range(k):
   if w.count(s[b])%2!=0:
      print("No")
   else:
      b+=1
print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

s = input()

arr = [(s.count(num)%2==0) for num in s]

print("Yes" if all(arr) else "No")

Submission status: Wrong Answer

Solution code:
w  = input()
ws = sorted(w)
if len(w)%2!=0:
    print("No")
else:
    for i in range(len(w)):
        if i%2 != 0:
            if ws[i] != ws[i-1]:
                print("No")
                break
    print("Yes")

Submission status: Wrong Answer

Solution code:
# -*- coding: UTF-8 -*-
w = input()
count = 0
for c in w:
    if c.islower() == True:
        count += 1
if count % 2 == 1:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
mojiretsu = input()
lett = list(mojiretsu)
numlist = []
for i in lett:
    num = lett.count(i)
    numlist += [num]
jud = []
for i in numlist:
    if i%2 == 0:
        jud += ['Yes']
    else:
        jud += ['No']

anslist = [x for x in set(jud) if jud.count(x) >= 1]

ans = anslist[0]

print(ans)

Submission status: Wrong Answer

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

print('Yes')

Submission status: Wrong Answer

Solution code:
w = "abaccaba"
# w = input()
dct_str = dict.fromkeys(w, 0)

for alp in w:
    dct_str[alp] += 1
flag = True
for alp in dct_str.keys():
    if dct_str[alp] % 2 != 0:
        flag = False

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

Submission status: Wrong Answer

Solution code:
w = input()
dct_str = dict.fromkeys(w, 0)

for alp in w:
    dct_str[alp] += 1
flag = True
for alp in dct_str.keys():
    if dct_str[alp] % 2 != 0:
        flag = False

if flag == True:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
w=input()
def solve():
  for j in [chr(i) for i in range(91,91+26)]:
    if w.count(j)%2==0:
      print("No")
      return
  print("Yes")
  return

solve()

Submission status: Wrong Answer

Solution code:
def main():
    w = input()
    judge = ""
    for i in w:
        if w.count(i) %2 ==0:
            judge = "Yes"
        else:
            judge = "No"
            break
    print(judge)

Submission status: Wrong Answer

Solution code:
def main():
    w = input()
    judge = ""
    for i in w:
        if w.count(i) %2 ==0:
            judge = "yes"
        else:
            judge = "No"
            break
    print(judge)
main()

Submission status: Wrong Answer

Solution code:
def main():
    w = input()
    judge = 0
    for i in w:
        if w.count(i) %2 ==0:
            judge = "yes"
        else:
            judge = "No"
    print(judge)
main()

Submission status: Wrong Answer

Solution code:
w = str(input())

w_list = list(w)

str_list = [chr(i) for i in range(97, 97+26)]

count = 0

for char in str_list:
	if w_list.count(char)%2 == 0:
		count +=1
	else:
		print("NO")
		break

if count == 26:
	print("YES")

Submission status: Wrong Answer

Solution code:
w = str(input())

w_list = list(w)

str_list = [chr(i) for i in range(97, 97+26)]

count = 0

for i,_ in enumerate (str_list):
	if w_list.count(str_list[i])%2 == 0:
		count +=1
	else:
		print("NO")
		break

if count == 26:
	print("YES")

Submission status: Wrong Answer

Solution code:
w=input()
odd=[i for i in set(w) if w.count(i)%2]
print('NO' if odd else 'YES')

Submission status: Wrong Answer

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


def main():

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


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

Submission status: Wrong Answer

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


def main():

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


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

Submission status: Wrong Answer

Solution code:
w = input()
print('Yes') if sum([int(w.count(chr(x))%2) for x in range(65,65+26)])==0 else print('No')

Submission status: Wrong Answer

Solution code:
s=input()
flg='True'
ss = set(s)
for c in list(ss):
  if s.count(c) % 2 != 0:
    flg='False'
    break
print(flg)

Submission status: Wrong Answer

Solution code:
N=input()
for i in N:
  if N.count(i)%2==0:
    pass
  else:
    print("NO")
    exit()
print("YES")

Submission status: Wrong Answer

Solution code:
import re

list = input()
list_set = set(list)
for set_string in list_set:
    cheak = re.findall(set_string, list)
    if len(cheak) % 2 ==0:
        continue
    else:
        print('No')
        exit()
print('YES')

Submission status: Wrong Answer

Solution code:
import re

list = input('>>')
list_set = set(list)
for set_string in list_set:
    cheak = re.findall(set_string, list)
    if len(cheak) % 2 ==0:
        continue
    else:
        print('No')
        exit()
print('YES')

Submission status: Wrong Answer

Solution code:
w=input()
s=[0]*123
while len(w)==0:
    for i in range(97,97+26):
        if chr(i)==w[0]:
            s[i]+=1
            w=w[1:]
c=1
for i in range(97,97+26):
    if s[i]%2!=0:
        c=0
        break
if c==1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()

SS = list(set(S))
num = []
for i in range(len(SS)):
    num.append(S.count(SS[i]))
num
if all(n%2 for n in num)%2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
w = input()
dic = {}
flag = True

for wd in w:
  if w not in dic:
    dic[w] = 0
  dic[w] += 1
  
for dicw in dic:
  if dic[dicw] % 2 == 1:
    flag = False
    break
    
if flag == True:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
listW = list(input())
listW.sort()
counter=0
bef=0
index=0
flag=0
while index < len(listW):
    if index==0:
        bef=listW[index]
        counter=1
    elif listW[index]==bef:
        counter+=1
    else:
        if counter%2==0:
            bef=listW[index]
            counter=1
        else:
            flag=1
            break
    index+=1

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

Submission status: Wrong Answer

Solution code:
import collections

def mod(x):
  x % 2

a = input()
b = list(a)

c = collections.Counter(b)

countc = c.values()

modc = map(mod, countc)

if '1' in modc:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
s=list(input())
if len(s)%2==0 and len(s)%len(set(s))==0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
#B
w = input()
dic = {chr(i+ord('a')): 0 for i in range(0, 26)}
for c in w:
    dic[c] += 1
print(dic) #
result = 'No'
for i in range(26):
    if dic[chr(i+ord('a'))] % 2 != 0: break
else: result = 'Yes'
print(result)