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:
alp=list("qwertyuiopasdfghjklzxcvbnm")
s=list(input())
out=[0]*len(alp)

for c in s:
  out[alp.index(c)]+=1
res="Yes"
for x in out:
  if x%2==1:
    res="No"
    break
    
print(res)

Submission status: Accepted

Solution code:
import math
from collections import deque
from collections import defaultdict

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	#data = [2]
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	#ans = [x for x in data if x!=0]
	ans = data[:]
	return ans

w = readChar()

d = defaultdict(int)

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

for i in d:
	if d[i]%2==1:
		print("No")
		exit()

print("Yes")

Submission status: Accepted

Solution code:
s=input()
s=sorted(s)
t=s[::2]
if len(s)%2==0 and s==sorted(t*2):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
#from fractions import gcd
#from itertools import combinations # (string,3) 3回
#from collections import deque
#from collections import defaultdict
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
w = input()
for i in range(26):
    c = chr(ord('a')+i)
    if w.count(c)%2:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
s = input()

from collections import Counter

c = Counter(s)

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

print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

##### 割り算の切り上げ #####
# tmp = -(-4 // 3)

##### dict の for文 #####
# for k, v in d.items():
#     print(k, v)

##### 進数の変換 #####
# bin_str = bin(i)[2:]
# oct_str = oct(i)[2:]
# hex_str = hex(i)[2:]

##### とても大きな数 と 小数の計算誤差 #####
# 「Decimal」は計算誤差を 0にできる。必要に応じて粒度を設定せよ。
# getcontext().prec = 100
#
# tmp = Decimal(i)
# A,B = map(Decimal, input().split())
# ans = A * B

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	w = inputStr()
	ans = {}

	for i in w:
		if i in ans:
			ans[i] += 1
		else:
			ans[i] = 1
			
	for k, v in ans.items():
		if v % 2 == 1:
			print("No")
			sys.exit()
	print("Yes")



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 2分検索のリバース
def bisect_left_reverse(a, x):
    if a[0] <= x:
        return 0
    if x < a[-1]:
        return len(a)
    # 二分探索
    ok = len(a) - 1
    ng = 0
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if a[mid] <= x:
            ok = mid
        else:
            ng = mid
    return ok

def bisect_right_reverse(a, x):
    if a[0] < x:
        return 0
    if x <= a[-1]:
        return len(a)
    # 二分探索
    ok = len(a) - 1
    ng = 0
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if a[mid] < x:
            ok = mid
        else:
            ng = mid
    return ok

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# 2分検索
# 存在しない場合: None 存在する場合: その値
def binary_search(list, item):
    low = 0
    high = len(list) - 1

    while low <= high:
        mid = (low + high) //2
        guess = list[mid]
        if guess == item:
            return mid
        if guess > item:
            high = mid -1
        else:
            low = mid + 1
    return None

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# N 個のボールを K グループに分ける場合のパターン数
def sunuke(N, K, mod=10**9+7):
	if N < K or K-1 < 0:
		return 0
	else:
		return combination(N-1, K-1, mod)

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)


class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
def dfs(graph,parent,counter,edge):
    stk = []
    stk.append(edge)
    while len(stk) > 0:
        p = stk.pop()
        for e in graph[p]:
            if parent[p] == e:
                continue
            else:
                parent[e] = p
                counter[e] += counter[p]
                stk.append(e)

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
w = input()
l = list(w)
wl = sorted(l)

flag = True
for i in range(0, len(wl), 2):
    if len(wl) % 2 == 1:
        print('No')
        flag = False
        break
    else:
        if wl[i] != wl[i + 1]:
            print('No')
            flag = False
            break
if flag:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

ap = {}
for s in w:
    if s in ap:
        ap[s] += 1
    else:
        ap[s] = 1

for k in ap:
    if ap[k] % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
letters=[]
count=[]
for i in range(len(s)):
  if s[i] in letters:
    count[letters.index(s[i])]+=1
  else:
    count.append(1)
    letters.append(s[i])
failflag=0
for i in range(len(count)):
  if count[i]%2==1:
    failflag=1
if failflag==0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

c = Counter(w)

flag = True
for j in c.values():
    if (j%2) != 0:
        flag = False
    
if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

w = str(input())
arr = []

for i in range(0,len(w)):
  arr.append(w[i])
arr = sorted(arr)

if len(arr)%2 == 1:
  print("No")
  sys.exit()

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

Submission status: Accepted

Solution code:
def countstr(s) : 
  for i in range(len(s)) : 
    if s.count(s[i]) % 2 : 
      return False
  return True

w = input()

if countstr(w) : 
  print('Yes')
  
else : 
  print('No')

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

Solution code:
import collections

def main():
    S = input()
    itemS = list(zip(*collections.Counter(S).items()))
    for item in itemS[1]:
        if item%2 == 1:
            print('No')
            return
    print('Yes')

if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
d = {}
s = input()
for c in s :
  d[c] = 0

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

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

Submission status: Accepted

Solution code:
# coding = SJIS
Alfa = "abcdefghijklmnopqrstuvwxyz"
w = str(input())
for i in Alfa:
    if w.count(i) % 2 == 1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
# Vicfred
# https://atcoder.jp/contests/abc044/tasks/abc044_b
# implementation
w = input()

english = {}

for ch in w:
    if ch in english:
        english[ch] += 1
    else:
        english[ch] = 1

beautiful = True
for value in english.values():
    if value%2 == 1:
        beautiful = False

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

Solution code:
import collections

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

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

Submission status: Accepted

Solution code:
w=input()
flag=True
for i in str(w):
  if int(str(w).count(i))%2==0:
    continue
  else:
    flag=False
print("Yes" if flag==True else "No")

Submission status: Accepted

Solution code:
W = list(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']
for e in L:
    if W.count(e) % 2 == 1:
        print('No')
        exit()
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:
from collections import Counter


w = input()
ans = True

dict_w = Counter(w)
#print(dict_w)

for x in dict_w.values():
    if int(x)%2 != 0:
        ans = False

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

Submission status: Accepted

Solution code:
s=list(input())
flag="Yes"
while(len(s)>0):
  d=s[0]
  if s.count(d)%2==1:
    flag="No"
    break
  else:
    for i in range(s.count(d)):
      s.remove(d)
print(flag)

Submission status: Accepted

Solution code:
W=list(input())

d = {}
for c in W:
  d[c] = d[c]+1 if (c in d) else 1

result = "Yes"
for c in d:
  if d[c] % 2 != 0:
    result = "No"
    break;

print (result)

Submission status: Accepted

Solution code:
w = str(input())
n = 1
if len(w) == 2*n + 1:
  print ('No')
l=[]
for i in w:
  l.append(i)

sort=sorted(l)

import collections
c = collections.Counter(sort)
v_list = list(c.values())

ans='Yes'
for i in v_list:
  if i % 2 != 0:
    ans='No'
    break
    
print(ans)

Submission status: Accepted

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

ans = 'Yes'

for a in range(length):
    if w.count(w[a]) % 2 != 0:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

Solution code:
w = input()
w = list(w)
length = len(w)
w.sort()

ans = 'No'

if length % 2 == 0:
    for a in range(0, length, 2):
        if w[a] == w[a+1]:
            ans = 'Yes'
        else:
            ans = 'No'
            break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w=input()
wset=set(w)
yn=0
for i in range(len(wset)):
    str=wset.pop()
    if w.count(str)%2==1:
        yn=1
        break
if yn==1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in counter.values():
   
    if i % 2 == 0:
        flag = "yes"
    else:
        print("No")
        flag = "no"
        break
if flag == "yes":
    print("Yes")

Submission status: Accepted

Solution code:
from collections import defaultdict
d = defaultdict(int)
w = input()
for wi in w:
  d[wi] += 1

for wi in d:
  if d[wi] % 2 == 1:
    print('No')
    quit()

print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
W=list(input())
w=Counter(W)
for k,v in w.items():
    if v%2==1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
#!/bin/usr/env

S = input()

tmp = {}
ans = []
for i in S:
  if (i in tmp):
    tmp[i] += 1
  else:
    tmp[i] = 1

for j in tmp.values():
  if j % 2 == 1:
    print("No")
    exit()
  else:
    pass

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
flag = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())
tmps=list(set(s))
flag=False
for i in tmps:
  if s.count(i)%2==1:
    flag=True
    break

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

Submission status: Accepted

Solution code:
w=input()
ans=dict()
for i in range(len(w)):
	if w[i] in ans:
		ans[w[i]]+=1
	else:
		ans[w[i]]=1
for j in ans:
	if ans[j]%2!=0:
		print('No')
		exit()
print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
s = input()
ans = [False if i%2 else True for i in Counter(s).values()]
print("Yes" if all(ans) else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#import numpy as np
#from decimal import *

w = input()
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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#import numpy as np
#from decimal import *

w = input()
W = Counter(w)
for v in W.values():
	if v%2:
		print("No")
		break
else:
	print("Yes")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = str(input())

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

for i in wlst:
    if wlst.count(i) % 2 == 0:
        continue
    else:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
from collections import defaultdict
w = input()
count = defaultdict(int)
for c in w:
    count[c] += 1

for k, v in count.items():
    if v % 2 != 0:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
str_box = {}
jodge = 1
for ss in S:
    if ss in str_box:
        str_box[ss] += 1
    else:
        str_box[ss] = 1
for i in str_box.values():
    if i % 2 != 0:
        jodge = 0
if jodge:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = list(input())

all = sorted([x for x in set(w) if w.count(x) > 0])
beautiful = sorted([x for x in set(w) if w.count(x) % 2 == 0])

if all == beautiful:
	print("Yes")
else :
	print("No")

Submission status: Accepted

Solution code:
#美しい文字列　044_B

w=input()
count=0
ans='Yes'
t=''
for i in range(len(w)):
    count=0
    t=w[i]
    for e in range(len(w)):
        if t==w[e]:
            count=count+1
    if count%2==1:
        ans='No'
        break
    else:
        ans='Yes'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

for i in l:
    if i%2 == 1:
        print("No")
        exit()

print("Yes")

Submission status: Accepted

Solution code:
w = list(input())
ans = "Yes"

for i in w:
    cnt = 0
    for j in w:
        if i == j:
            cnt += 1
    if cnt%2 == 1:
        ans = "No"
        break

print(ans)

Submission status: Accepted

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

f = True

for word in word_set:
    if w.count(word) % 2 != 0:
        f =False
        break

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

Submission status: Accepted

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

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

if all(map(lambda x: x % 2 == 0, a)):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import collections
import sys
w = list(input())
n = len(set(w))
c = collections.Counter(w)
for i in range(n):
    if (c.most_common()[i][1] % 2) != 0:
        print("No")
        sys.exit()

print("Yes")

Submission status: Accepted

Solution code:
cntr = [0] * 26
for c in input():
    cntr[ord(c) - 97] += 1
print('No') if any(v % 2 for v in cntr) else print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter


print('No') if any(v % 2 for v in Counter(input()).values()) else print('Yes')

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

w = input()

dic = defaultdict(int)

for x in w:
	dic[x] += 1

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

Submission status: Accepted

Solution code:
W = input()
dic = {}

for w in W:
  if w in dic:
    dic[w] += 1
  else:
    dic[w] = 1

count = 0
for i in dic.values():
  if i % 2 == 0: count += 1

if count == len(dic): print("Yes")
else: print("No")

Submission status: Accepted

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

dic=defaultdict(int)
for c in w:
  dic[c]+=1
  
for v in dic.values():
  if v%2==1:
    print("No")
    break
else:
  print("Yes")

Submission status: Accepted

Solution code:
import collections
a=input()
b=list(a)
b=collections.Counter(b)
c=0
d=0
for i in b:
	if b[i]%2!=0:
		c=c+1

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

Submission status: Accepted

Solution code:
def is_beautiful(s):

    b = [0]*30

    for i in s:
        b[ord(i)-97] += 1
    
    flag = True
    for i in b:
        if i%2 != 0:
            flag = False
    
    return flag


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

Submission status: Accepted

Solution code:
s = input()
from collections import Counter
C = Counter(s)
for v in C.values():
	if v % 2:
		print("No")
		exit()
print("Yes")

Submission status: Accepted

Solution code:
w = list(input())

alpha = list("abcdefghijklmnopqrstuvwxyz")
count = [0] * len(alpha)

for i in w:
  for index,j in enumerate(alpha):
    if i ==j:
      count[index] += 1

odd = "Yes"
for i in count:
  if i % 2 == 1:
    odd = "No"
    break
print(odd)

Submission status: Accepted

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

print("Yes")

Submission status: Accepted

Solution code:
import collections
w = input()
s = list(w)
c = collections.Counter(s)
ls = list(c.most_common())
flag = 0
for i in range(len(ls)):
    if ls[i][1] %2 == 0:
        continue
    else:
        flag += 1
        print("No")
        break
if flag == 0:
    print("Yes")

Submission status: Accepted

Solution code:
w = str(input())

d ={}

flg = True

for i in range(len(w)):
    temp = w[i]
    
    
    if temp in d:
        d[temp] += 1
    else:
        d[temp] = 1
        

for i in d.values():
    
    if i %2 !=0:
        flg= False
    
if flg == True:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w = input()
 
f = True
for s in w:
	a = w.count(s)
	if a%2 != 0:
		f = False
		break
 
if f:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import string

w=input()
a=string.ascii_lowercase

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

Submission status: Accepted

Solution code:
w = input()
cdict = {}
for c in w:
  if c in cdict:
    cdict[c] += 1
  else:
    cdict[c] = 1
    
if all(cdict[c]%2==0 for c in cdict):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
w = input()
duplex = set(w)
before_w = ''
result = 'Yes'
diff = 0
for i in duplex:
    before_w = w.replace(i, '')
    diff = diff + (len(w) - len(before_w))
    w = before_w
    if diff % 2 == 0:
        pass
    else:
        result = 'No'
        break

print(result)

Submission status: Accepted

Solution code:
import string
As=string.ascii_lowercase
w=input()
l=[]

for i in range(len(As)):
    l.append(w.count(As[i])%2==0)

print(['No','Yes'][all(l)])

Submission status: Accepted

Solution code:
#解法2
w = input()
ls = [0]*26
#各文字の出現回数リスト
for i in range(len(w)):
  ls[ord(w[i])-97] += 1
  #ASCIIコードに対応した配列を+1する
flag = 0
for i in range(len(ls)):
  if ls[i]%2 == 0:
    continue
  else:
    flag += 1
    break
if flag == 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#解法3
import collections
w = input()
s = list(w)
c = collections.Counter(s)
l = list(c.most_common())
#出現回数のリストがl
flag = 0
for i in range(len(l)):
  if l[i][1]%2 == 0:
    continue
  else:
    flag += 1
    break
if flag == 0:
  print("Yes")
else:
  print("No")