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

Submission status: Accepted

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]
anslisT = [x for x in jud if jud.count(x) == 1]

if anslist == ['Yes']:
    print('Yes')
elif anslisT == ['Yes']:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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:
counts = [1] * 26
s = input()
for c in s:
    counts[ord(c) - ord("a")] += 1
tmp = 1
for c in counts:
    tmp *= c
print("Yes" if tmp % 2 == 1 else "No")

Submission status: Accepted

Solution code:
w=list(input())
if len(w)%2==1:print("No")
else:
    while w[0] in w[1:]:
        t=w[0]
        w.remove(t)
        w.remove(t)
        if w==[]:break
    print(["No","Yes"][w==[]])

Submission status: Accepted

Solution code:
s=input()
alpha=list('abcdefghijklmnopqrstuvwxyz')
ans=[0]*26
for i in range(len(s)):
  for j in range(26):
    if s[i]==alpha[j]:
      ans[j]+=1
for i in range(26):
  if ans[i]%2==1:
    print('No')
    break
  if i==25:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
alphabet="abcdefghijklmnopqrstuvwxyz"
list=[s.count(x) for x in alphabet]
for i in range(len(list)):
  if list[i]%2==0:
    list[i]=0
  else:
    list[i]=1
print("Yes" if sum(list)==0 else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

s = []
a = 0
x = input()
if len(x) % 2 != 0:
    print('No')
else:
    for i in x:
        s.append(i)
    c = collections.Counter(s)
    values, counts = zip(*c.most_common())
    for j in counts:
        if j % 2 == 0:
            a += 1
    if len(counts) == a:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
w=list(input())
w_dct={}
for i in w:
    if i in w_dct.keys():
        w_dct[i]+=1
    else:
        w_dct[i]=1
        
tag=True
for i, j in w_dct.items():
    if j%2 ==0:
        pass
    else:
        tag=False
        
if tag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

w = str(input())
h = set(w)

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


print("Yes")

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
w = input()

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

Submission status: Accepted

Solution code:
import collections
S = list(input())
count = collections.Counter(S).most_common()

for i in range(len(count)):
    if (int(count[i][1]) % 2 != 0):
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
import collections
letter=collections.Counter(input())
counter=0
for v in letter.values():
    if v%2==1:
        counter +=1
        break
print("Yes") if counter==0 else print("No")

Submission status: Accepted

Solution code:
import re

pattern = '[a-z]+$'
w = input()
result = re.match(pattern, w)
if result:
    w_set = set(list(w))
    for word in w_set:
        counter = w.count(word)
        if counter % 2 == 1:
            print('No')
            break
    else:
        print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter
w = input()
num = Counter(w)
ans = list(num.values())
if not any([i%2 for i in ans]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()
set_w = set(w) # 各文字を取得
for i in set_w:
    if (w.count(i) % 2 != 0):
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
def beautiful_strings(w: str) -> bool:
    freq = {}
    for c in w:
        freq.setdefault(c, 0)
        freq[c] += 1
    return all(f % 2 == 0 for f in freq.values())


if __name__ == "__main__":
    w = input()
    yes = beautiful_strings(w)
    print('Yes' if yes else 'No')

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
w = input()

d = {}
for x in w:
    d[x] = d.get(x, 0) + 1

flag = True
for x in d.values():
    if x%2 != 0:
        flag = False

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

s_list = list(s)
s_set = set(s_list)
flag = 0
for n in s_set:
  if s.count(n) % 2 != 0:
    flag = 1
    
if flag == 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.readline
w = input().rstrip()
dic = {}
for i in w:
	if not i in dic:
		dic[i] = 1
	else:
		dic[i] += 1
for word in dic:
	if dic[word]%2 != 0:
		print("No")
		break
else:
	print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

main2()

Submission status: Accepted

Solution code:
import collections
s = input()
m = collections.Counter(s)
 
if len(list(filter(lambda x:x%2 == 1,m.values())))  > 0:
 	print("No")
else:
 	print("Yes")

Submission status: Accepted

Solution code:
a = input()
a = [str(x) for x in a]

import collections
b = collections.Counter(a)
N = len(b)
c = 0

for i in b.values():
    if i % 2 == 0:
        c += 1 
    else:
        pass
      
print('Yes' if c == N else "No")

Submission status: Accepted

Solution code:
from functools import reduce

def main():
    # 一文字のみを読み込み
    # s = input().rstrip().split(' ')
    
    # スペース区切りで標準入力を配列として読み込み
    # s = input().rstrip().split(' ')

    # 位置文字ずつ標準入力を配列として読み込み
    # s = list(input().rstrip())
    s = list(input().rstrip())
    dict = {}
    b_flag = True
    for char in s:
        if(char in dict.keys()):
            dict[char] = dict[char] + 1
        else:
            dict[char] = 1
        
    for v in dict.values():
        if v % 2 == 1:
            b_flag = False
    if b_flag:
        print('Yes')
    else:
        print('No')
        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
str = input()
dict = {}
isBeautiful = True

for i in range(len(str)):
  if str[i] in dict:
    dict[str[i]] += 1
  else:
    dict[str[i]]  = 1

    
for val in dict.values():
  if(val %2 != 0):
    isBeautiful = False

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

Submission status: Accepted

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

if len(list(filter(lambda x:x%2 == 1,m.values())))  > 0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
import string

w = input()

ans = 'Yes'
for i in range(len(string.ascii_lowercase)):
	if w.count(string.ascii_lowercase[i:i+1])%2!=0:
		ans = 'No'
		break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
"""
n,k,x,y = IR(4)
print(min(k,n)*x+max(n-k,0)*y)
"""
#B
w = S()
d = defaultdict(int)
for i in w:
    d[i] += 1
for i in d.values():
    if i%2:
        print("No")
        quit()
print("Yes")
#C
"""
n,a = LI()
x = LI()
s = sum(x)
dp = [[[0 for i in range(s+1)] for j in range(n+1)] for k in range(n+1)]
for i in range(n+1):
    dp[i][0][0] = 1
for i in range(1,n+1):
    for j in range(1,n+1):
        for k in range(s+1):
            if k >= x[i-1]:
                dp[i][j][k] = dp[i-1][j][k]+dp[i-1][j-1][k-x[i-1]]
            else:
                dp[i][j][k] = dp[i-1][j][k]
ans = 0
for i in range(1,n+1):
    if a*i <= s:
        ans += dp[n][i][a*i]
print(ans)
"""

#D
"""
def f(b,n):
    m = n
    res = 0
    while m > 0:
        res += m%b
        m //= b
    return res
n,s = IR(2)
if n == s:
    print(n+1)
    quit()
if n == 1:
    print(-1)
    quit()
k = int(n**0.5)
for b in range(2,k+1):
    if f(b,n) == s:
        print(b)
        quit()
for p in range(1,k+1)[::-1]:
    if (n-s)%p == 0:
        b = (n-s)//p+1
        if b != 0:
            if f(b,n) == s:
                print(b)
                quit()
print(-1)
"""
#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
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()
l = list(w)
s = set(l)
for i in s:
    if l.count(i)%2!=0:
        print("No")
        exit()
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
w = input()
o = []
for i in range(len(w)):
    o.append(ord(w[i]))

c = [0] * 26
for i in range(len(w)):
    c[o[i] - 97] += 1

i = 0
while i < 26:
    if c[i] % 2 == 0:
        i += 1
    else:
        print('No')
        break
if i == 26:
    print('Yes')

Submission status: Accepted

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: Accepted

Solution code:
s = input()
import collections

c = collections.Counter(s)

if len(list(filter(lambda x:x%2==1,c.values()))) > 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
w = input()
word_list = [chr(i + 96) for i in range(1, 27)]
check = True
for word in word_list:
    if w.count(word) % 2 != 0:
        check = False
        break
print('Yes' if check else 'No')

Submission status: Accepted

Solution code:
S = input()

def unique_list(seq):
    seen = set()
    seen_add = seen.add
    return [x for x in seq if x not in seen and not seen_add(x)]


def solve():
    ul = unique_list(S)
    for w in ul:
        if not S.count(w) % 2 == 0:
            return "No"

    return "Yes"


res = solve()
print(res)

Submission status: Accepted

Solution code:
def main():
    w = input()
    cnt = {}
    for c in w:
        if c not in cnt:
            cnt[c] = 0
        cnt[c] += 1
    for k in cnt:
        if cnt[k] % 2 == 1:
            print("No")
            return
    print("Yes")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
w = [i for i in input()]
wset = set(w)
check = True
for i in wset:
    if w.count(i)%2!=0:
        check = False
        break
if check==True:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

dic = {}

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

for i in dic:
    if dic[i] % 2 == 0:
        continue
    print('No')
    exit()
print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


w = input()
s = list(w)

l = []


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

Submission status: Accepted

Solution code:
S = input()
for x in set(S):
	if S.count(x) % 2:
		print("No")
		exit()
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

n = len(s)
k = 0

for i in range(n):
    c = s.count(s[i])
    k += 1
    if c % 2 != 0:
        print('No')
        break
    
    if k == n:
        print('Yes')

Submission status: Accepted

Solution code:
w=str(input())
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']
p=0
for i in range(26):
    num=w.count(L[i])
    if num%2==0:
        p+=1
if p==26:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: UTF-8

w = input()

def isbeautiful(w):
    for a in [chr(ord('a')+i) for i in range(26)]:
        if w.count(a) % 2 != 0:
            return False
    return True

print('Yes' if isbeautiful(w) else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,ans=input(),0;a=[s[i]for i in range(len(s))];a.sort()
for i in a:
  if a.count(i)%2!=0:ans=1
if ans==0:print("Yes")
else:print("No")

Submission status: Accepted

Solution code:
String = str(input())

# setで重複を無くし，ビット演算でカウントする
# ビット演算，2進数で奇数を表した場合、最後の1桁は必ず1
## print(char.count(String) & 1)
result = {}
for char in String:
    try:
        result[char] += 1
    except KeyError:
        result[char] = 1

result = list(map(lambda x: x % 2, list(result.values())))
if result == [0] * len(result):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
String = str(input())

result = {}
for char in String:
    try:
        result[char] += 1
    except KeyError:
        result[char] = 1

result = list(map(lambda x: x % 2, list(result.values())))
if result == [0] * len(result):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import collections


W = input()
c = collections.Counter(W)
cm = c.most_common()

ans = 'Yes'
for v in cm:
    if v[1]%2 != 0:
        ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
# ABC 044 B
import collections
S =list(input())
ANS = 0
counter = collections.Counter((S))
for _ in set(S):
    if counter[_] %2 ==0:
        ANS +=1
if ANS ==len(set(S)):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter

w = Counter(input())
ans = 'Yes'

for value in w.values():
    if value % 2:
        ans = 'No'
        break
print(ans)

Submission status: Accepted

Solution code:
import collections
w=input()
dic=collections.Counter(w)
if all(i%2==0 for i in dic.values()):
    print("Yes")
else:print("No")

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = list(input())

x = set(w)

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

print('Yes')

Submission status: Accepted

Solution code:
w = input()
dic = {}
for c in w:
    dic[c] = dic.get(c,0)+1
for k in dic:
    if dic[k]%2==1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
word=input()
list=set(word)
T=True
for i in list:
  if word.count(i)%2==1:
    T=False
if T==True:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
alpha=["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"]
word=input()
T=True
for i in alpha:
  if word.count(i)%2==1:
    T=False
    break
if T==True:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def beautiful(w):
    t = set(w)
    s = [w.count(i) for i in t]
    for i in s:
        if i%2 != 0:
            return 'No'
    return 'Yes'
w = input()
print(beautiful(w))

Submission status: Accepted

Solution code:
from collections import Counter
c=Counter(input())
flag=0
for key in c:
  if c[key]%2:
    flag=1
if flag:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

from collections import Counter

cs = Counter(w)

result = all(cs[c] % 2 == 0 for c in cs)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri Mar 15 09:40:47 2019

@author: 17664
"""

s = input()

alphaList = list(set(s))

cnt = 0
ans = 'Yes'

for i in alphaList:
    cnt = s.count(i)
    if cnt % 2 != 0:
        ans = 'No'
        break
    else:
        cnt = 0
        
print(ans)

Submission status: Accepted

Solution code:
w = input()
a = set(w)
b = []

for i in a:
  if w.count(i) % 2 == 0:
    b.append(0)
  else:
    b.append(1)
if 1 in b:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
w = input()[:-1]
C = Counter(w)
if all(v % 2 == 0 for v in C.values()):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
from operator import itemgetter
#以下てんぷら
def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")

def ip():
    return int(input())
#n = ip()                                     #入力整数1つ
#h,w= (int(i) for i in input().split())       #入力整数横2つ以上
#a = [int(i) for i in input().split()]        #入力整数配列
a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)

#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
#こっから本文
s = set()
for i in range(len(a)):
    s.add(a[i])
s = list(s)
for i in range(len(s)):
    b = a.count(s[i])
    if b%2:j(0)
j(1)

Submission status: Accepted

Solution code:
li = list(str(input()))

li1 = [x for x in set(li) if li.count(x) % 2 == 0]
li2 = list(set(li))

if li1 == li2:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
w = input()
for x in set(w):
    if w.count(x)%2 == 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
w = input()

occ = {}
for ch in w:
    if not ch in occ:
        occ[ch] = 0
    occ[ch] += 1
ans = True
for v in occ.values():
    if v % 2 == 1:
        ans = False

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

Submission status: Accepted

Solution code:
""" AtCoder """

w = list(input())

w.sort()

if len(w) % 2 == 1:
    print("No")
    exit()

for i in range(0, len(w)//2 + 1, 2):
    if w[i] != w[i+1]:
        print("No")
        exit()

print("Yes")

Submission status: Accepted

Solution code:
#n=int(input())
#li=input().split()
#li=list(map(int,input().split()))
n=input()
d=["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 len(n)%2==1:
    print("No")
else:
    flag=0
    ans="Yes"
    for i in range(26):
        if flag==0:
            count=0
            for j in range(len(n)):
                if n[j]==d[i]:
                    count+=1
            if count%2==1:
                flag=1
                ans="No"
                break
        else:
            break

    print(ans)

Submission status: Accepted

Solution code:
w = list(input().rstrip())
t = {}
for i in range(len(w)):
    k = w[i]
    if k in t:
        t[k] += 1
    else:
        t[k] = 1


r = True
for v in t.values():
    if v % 2 == 1:
        r = False
        break

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
ss=set(s)
l=[s.count(c)%2 for c in ss]
print('No' if sum(l) else 'Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
w = input()

if all([(w.count(i)+1) % 2 for i in string.ascii_lowercase]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
w = input()
alpha = [chr(i) for i in range(97, 97+26)]
for c in alpha:
  n = w.count(c)
  if (n % 2):
    print('No')
    sys.exit()
print('Yes')

Submission status: Accepted

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: 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 = list(str(input()))
x = list(set(w))
flag = 0
for i in range(len(x)):
  flag += (w.count(x[i]))%2
if flag == 0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
wlist = list(input())
counter = {}
for i in wlist:
    if i in counter:
        counter[i] += 1
    else:
        counter[i] = 1

a = list(counter.values())

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

Submission status: Accepted

Solution code:
a = input()  # ssdrtf
b = set(a)  # 重複をなくす

c = 0
for i in b:
    if a.count(i) % 2 == 1:  # もし奇数ならだめ
        c = 1
        break
        
if c == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S=input()
cnt ={}
flg = True
for s in S:
    if s not in cnt.keys():
        cnt[s]=1
    else:
        cnt[s]+=1
for i in cnt.values():
    if i % 2 !=0:
        flg = False
print('Yes' if flg else 'No')

Submission status: Accepted

Solution code:
w=input()
al=[0]*26
def amari(a):
    return a%2
for i in range(len(w)):
    al[ord(w[i])-97]+=1
ans=list()
ans=map(amari,al)
print('No'if 1 in ans else "Yes"  )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
S = input()
cnt = {}
flg = True
for s in S:
  if s not in cnt:
    cnt[s] = 1
  else:
    cnt[s] += 1
for i in cnt.values():
  if i % 2 != 0:
    flg = False
print('Yes' if flg else 'No')

Submission status: Accepted

Solution code:
w = input()
w = list(w)
w.sort()
judge = 1

if(len(w)%2 == 1):
  print('No')
else:
  for i in range(int(len(w)/2)):
    if(w[2*i] != w[2*i+1]):
      judge = 0
      break

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
w=input()
l=[w[i] for i in range(len(w))]
l.sort()
m=[0]*26
m[0]+=1
i=0
v=0
for i in range(1,len(w)):
    if l[i] in l[:i]:
        m[v]+=1
    else:
        v+=1
        m[v]+=1
    i+=1
for c in m:
    if c%2==1:
        print("No")
        sys.exit()
print("Yes")

Submission status: Accepted

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

print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
W = []
for i in w:
    W.append(i)
ans = "Yes"
for i in set(W):
    if W.count(i) % 2 != 0:
        ans = "No"

print(ans)

Submission status: Accepted

Solution code:
from collections import Counter
w = list(input().rstrip())
c = Counter(w)
if all([True if cnt[1] % 2 == 0 else False for cnt in c.items()]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b=set(a)
bool = True
for i in b:
    if a.count(i)%2!=0:
        bool = False
if bool:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w = list(raw_input())

alpha = [chr(i) for i in range(97,97+26)]
cnt = [0]*26

for i in w:
    cnt[ord(i)-97] += 1
res = 'Yes'
for i in cnt:
    if i%2 != 0:
        res = 'No'
print res

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
w=input()
s=set(w)
r=True
for i in s:
  if w.count(i)%2==1:
    r=False
if r:
  print('Yes')
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 = list(input())

flg = True

for i in range(len(w)):
    if w.count(w[i]) % 2 != 0:
        flg = False
        break

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