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:
from collections import Counter
w = list(input())
c = Counter(w)
for i in range(len(w)):
    if int(c[w[i]]) % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word_list = input()

word_dict = {}

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

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

print(Flag)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:
from collections import Counter

s = Counter(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def kansu(S):

    s_flg = True

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

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




S = nyu()
kansu(S)

Submission status: Accepted

Solution code:
w = input()

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

  return('Yes')

print(beauty(w))

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

Solution code:
w = input()

# lenw = int(len(w))

# if lenw%2==0:
#     print("Yes")

# else:
#     print("No")

counter = {}
alphabets = "abcdefghijklmnopqrstuvwxyz"

for i in alphabets:
    counter[i] = 0

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

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

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

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

w = input()

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

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

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

Submission status: Accepted

Solution code:
import sys

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

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

print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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



if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
from collections import Counter


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

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

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

Submission status: Accepted

Solution code:
from collections import Counter

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
w = list(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:
s = input()
ss = list(set(s))
N = len(ss)

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

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]
## math ##
def to_bin(x: int) -> str: return format(x, 'b') # rev => int(res, 2)
def to_oct(x: int) -> str: return format(x, 'o') # rev => int(res, 8)
def to_hex(x: int) -> str: return format(x, 'x') # rev => int(res, 16)
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]
## libs ##
from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left
#======================================================#

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter

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

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

print('Yes')

Submission status: Accepted

Solution code:
import numpy as np
import sys

input = sys.stdin.readline

alp = "abcdefghijklmnopqrstuvwxyz"
alp = list(alp)

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

#print(w)
cnt = 1
for i in range(1,len(w)):
#    print( w[i],cnt)
    if w[i] ==w[i-1] :
        cnt +=1
    else:
        if cnt%2 == 1:
            print("No")
            exit()
        else:
            cnt = 1

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
w = input()

dic ={}

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

for i in dic:
    val = dic[i]

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

print('Yes')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2020/04/29
# AtCoder Beginner Contest 044 - B

# Input
w = input()

# Init
d = dict()

# Calc
for i in range(len(w)):
    if d.get(w[i]) == None:
        d[w[i]] = 1
    else:
        d[w[i]] = d[w[i]] + 1

ans = 'Yes'
for key in d:
    if d[key] % 2 == 1:
        ans = 'No'
        break

# Output
print(ans)

Submission status: Accepted

Solution code:
s = input()
from collections import Counter
a = Counter(s)
if [1 for value in a.values() if value % 2 != 0]:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
w = input()
d = {}
for c in w:
  if c in d:
    d[c] = not d[c]
  else:
    d[c] = True

for f in d.values():
  if f:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
G = []
q = 0
for x in w:
    if not ([x, True] in G or [x, False] in G):
        G.append([x, True])
    else:
        if [x, True] in G:
            G[G.index([x, True])][1] = False
        else:
            G[G.index([x, False])][1] = True
for h in range(len(G)):
    q += G[h][1]
#print(G)
if q == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
c=collections.Counter(list(input()))
cv=list(c.values())
ans=0
for i in range(len(cv)):
    if cv[i]%2==1:
        ans+=1
print('YNeos'[ans>0::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
	string = str(input())
	dp = [0 for _ in range(26)]
	for i in range(len(string)):
		dp[ord(string[i])-ord('a')]+=1
	for x in dp:
		if x%2!=0:
			print("No")
			return 
	print("Yes")
	return
main()

Submission status: Accepted

Solution code:
w=input()
x=list(sorted(set(w)))

flag=1
for i in x:
  if w.count(i)%2!=0:
    flag=0
    break
print('Yes' if flag==1 else 'No')

Submission status: Accepted

Solution code:
w=input()
x=list(sorted(set(w)))

#print(w,x)

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

Submission status: Accepted

Solution code:
import sys
w=input()
x='abcdefghijklmnopqrstuvwxyz'
for i in range(26):
  if w.count(x[i]) % 2 > 0:
    print('No')
    sys.exit()

print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

w=input()
a=[]
for i in range(len(w)):
  a.append(w[i])
c = collections.Counter(a)
b=list(c.values())
flag="T"
for i in range(len(b)):
  if b[i]%2!=0:
    print("No")
    flag="F"
    break
if flag=="T":
  print("Yes")

Submission status: Accepted

Solution code:
from collections import defaultdict

w = input()
cnt = defaultdict(int)

for i in range(len(w)):
    cnt[w[i]] += 1

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

print("Yes")

Submission status: Accepted

Solution code:
#bA 出現する要素は各1会で数えるのは良い（今回は文字列が短いからできただけ）
w = list(input())
if all(w.count(i)%2==0 for i in set(w)):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
w = input()
ans = "Yes"
if len(w) ^ 1:
    d = Counter(w)
    for c in d:
        if d[c] & 1:
            ans = "No"
            break
else:
    ans = "No"
print(ans)

Submission status: Accepted

Solution code:
ans = True
w = input()
for c in w: ans &= w.count(c)%2 == 0
print("Yes" if ans else "No")

Submission status: Accepted

Solution code:
from collections import Counter
w = input()
c = Counter()
for iw in w:
    c[iw]+=1
f = True
for v in c.values():
    if v%2!=0:
        f = False
        break
if f:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
from collections import Counter

input = sys.stdin.readline


def main():
    w = input().rstrip()

    c = Counter(w)
    ans = "Yes"
    for v in c.values():
        if v % 2 != 0:
            ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = list(input())
A = [ 0 for _ in range(26)]
for c in w:
    i = ord(c) - ord("a")
    A[i]+=1
ans = "Yes"
for a in A:
    if a%2 == 1:
        ans = "No"
        break
print(ans)

Submission status: Accepted

Solution code:
import collections
def calc_double(n):
    return n%2
a=input()
b=collections.Counter(a)
values=zip(*b.most_common())
c=list(values)
e=c[1]
d=list(map(int,e))
if sum(map(calc_double,d))==0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter

C = Counter(list(input()))

ans = 'No' if any(x % 2 for x in list(C.values())) else 'Yes'
print(ans)

Submission status: Accepted

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

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


for i in count.values():
	if not i%2 == 0:
		print("No") 
		break
else:
	print("Yes")

Submission status: Accepted

Solution code:
s = input()
for i in range(26):
    n = s.count(chr(ord('a')+i))
    if n%2==1:
        print('No')
        break
    if i == 25:
        print('Yes')

Submission status: Accepted

Solution code:
s = input()
alp = [0 for _ in range(26)]

for c in s:
    alp[ord(c) - ord('a')] += 1

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

Submission status: Accepted

Solution code:
import collections

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

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

print("Yes")

Submission status: Accepted

Solution code:
a = input()

for i in range(0,len(a)):
  c = 0
  for j in range(0,len(a)):
    if(a[i] == a[j]):
      c = c + 1
    else:
      continue
  if(c%2 != 0):
    print("No")
    exit()
  else:
    continue
    
print("Yes")

Submission status: Accepted

Solution code:
import sys
from collections import Counter

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    w = input()
    D = Counter(w)
    for v in D.values():
        if v % 2 != 0:
            print("No")
            break
    else:
        print("Yes")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = input()
n = len(s)

if n %2 != 0:
    print('No')
    sys.exit()
for i in range(97,124): 
    if s.count(chr(i)) %2 != 0:
        print('No')
        sys.exit()
print('Yes')

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')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
from collections import defaultdict
d = defaultdict(int)
w = input()

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

t = True
for key, v in d.items():
    if (v % 2 == 0):
        continue
    else:
        t = False
        break

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

Submission status: Accepted

Solution code:
w = input()
ans = 1

for wi in w:
    ans ^= ord(wi)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
asci = 0
for i in w:
  asci = asci^ord(i)
if asci == 0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
from collections import Counter
list_S = list(input())
list_C = Counter(list_S).values()

ans = "Yes"
for num in list_C:
    if num % 2 != 0:
        ans = "No"
        break

print(ans)

Submission status: Accepted

Solution code:
w = input()
# index, count = np.unique(list(w), return_counts=True)
d = {}
for c in w:
    if c in d.keys():
        d[c] += 1
    else:
        d.setdefault(c, 1)
for i, j in d.items():
    if j % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
w = str(input())
List = [w[i] for i in range(len(w))]
lis = sorted(List)
#print(lis)
uni = list(set(lis))
#print(uni)
ans = []
q = 0
for i in range(len(uni)):
    p = lis.count(uni[i])
    ans.append(p)
for j in range(len(ans)):
    q += ans[j]%2
if q == 0:
    print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

w = input()
c = Counter(w)

ans = "Yes"

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

print(ans)

Submission status: Accepted

Solution code:
from collections import Counter

w = input()
c = Counter(w)

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

print("Yes")

Submission status: Accepted

Solution code:
w = list(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter
readline = sys.stdin.buffer.readline
MOD = 10**9+7

def main():
    w = input()
    cnt = Counter(w)
    ans = 'Yes'
    for i in cnt.values():
        if i&1:
            ans = 'No'
    print(ans)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter
w=list(input())
a=Counter(w)
b=list(a.values())

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    w = input().rstrip()
    c = Counter(w)
    for i in c.values():
        if i%2 == 1:
            print('No')
            break
    else:
        print('Yes')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S=str(input())
s_list = "abcdefghijklmnopqrstuvwxyz"
n_list = []
for i in range(26):
  n_list.append(0)
for i in range(len(S)):
  n_list[s_list.index(S[i])] = n_list[s_list.index(S[i])] + 1
num = 1
for i in range(26):
  num = num * (n_list[i]+1)
if num % 2 == 1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import collections

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

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

print("Yes")

Submission status: Accepted

Solution code:
w = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

Solution code:
from collections import defaultdict


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
w = input()
len_w = len(w)
w = sorted(w)
moji = [chr(i) for i in range(97, 123)]
l = [0]*len_w
for i in range(len_w):
    if w.count(w[i]) % 2 != 0:
        print("No")
        quit()
print("Yes")

Submission status: Accepted

Solution code:
w = list(map(str,input()))
w.sort()
w = "".join(w)

flag = 0
w = [w[i*2:i*2+2] for i in range(-(-len(w)//2))]
for i in w:
  if len(i)==1 or not i[0] == i[1]:
    flag = 1
    break

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