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:
#解法1
w = input()
ls = []
#s = list(w)などとすることで省略できる
for i in range(len(w)):
  ls.append(w[i])
ls.sort()
#文字列ソート
now_str = ls[0]
#nowは現在の参照対象の文字列
now = 1
#nowは現在の文字の連続数、1から数える
flag = 0
#条件を満たしているかを考えるflag関数
for i in range(1,len(ls)):
  if ls[i] == now_str:
    now += 1
  else:
    #連続数が偶数ならば
    if now%2 == 0:
      now = 1
      now_str = ls[i]
      continue
    else:
      #連続数が奇数ならば
      flag += 1
      break
#最終処理
if now% 2 == 0:
  flag += 0
else:
  flag += 1
if flag == 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ABC_44_B():
    w = input()
    k=0
    s=0

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


if __name__ == '__main__':

    ABC_44_B()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
sl = [0 for _ in range(26)]
for i in range(len(s)):
    sl[ord(s[i])-97] += 1
ans = 0
for j in sl:
    if j%2 == 0:
        pass
    elif j%2 != 0:
        ans = 1
        break
if ans == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
w=input()
w1= set(w)
w2=Counter(w)
for i in w1:
    if w2[i]%2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
s = input()

C = [0]*26

for i in s:
    C[ord(i)-ord('a')] += 1
res = "Yes"
for i in C:
    if i % 2 != 0:
        res = "No"
print(res)

Submission status: Accepted

Solution code:
import collections
 
#文字列を一文字ずつ取得したいとき
def inputStrOnebyOne():
    s = list(input())
    return s
 
#整数を一つずつリストに入れる
def inputOnebyOne_Int():
    a = list(int(x) for x in input().split())
    return a
 
def main():
    w = list(input())
    C = collections.Counter(w)

    ret = "Yes"
    for c in C.values():
        if c%2 == 1:
            ret = "No"
            break
    print(ret)
 
if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
w = input()

li = [0] * 123
for i in range(len(w)):
    li[ord(w[i])] += 1

ans = 'Yes'
for j in li:
    if j % 2 == 1:
        ans = 'No'
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): return print(arg)
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)


#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############

S = S()
d = DD(int)
for s in S:
  d[s] += 1
for k in d:
  if d[k]%2:
    NE()
YE()

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): return print(arg)
def Y(): print("Yes"); return
def N(): print("No"); return

#####Shorten#####
def DD(arg): return defaultdict(arg)

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############

S = S()
d = DD(int)
for s in S:
  d[s] += 1
for k in d:
  if d[k]%2:
    N()
    exit()
Y()

Submission status: Accepted

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

print(b)

Submission status: Accepted

Solution code:
#! /usr/bin/env python3

from fractions import gcd
# from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement

S = input()

c = Counter(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a =[chr(ord('a') + i) for i in range(26)]
s = input()
for i in range(26):
    if s.count(a[i]) % 2 == 1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
from collections import defaultdict as dd
w=input()
dic=dd(int)
for char in w:
    dic[char] += 1
for val in dic.values():
    if val%2!=0:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(len(w)):
    if w[i] not in d:
        d[w[i]] = 1
    else:
        d[w[i]] += 1
        
for count in d.values():
    if count % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import Counter
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    c=Counter(input())
    for x in c.values():
        if x%2:
            print('No')
            break
    else:
        print('Yes')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter

w = input()
c = Counter(w)
if all(map(lambda x: x % 2 == 0, c.values())):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
dic = {}
s = input()
for i in s:
    if i not in dic:
        dic[i] = 1
    else:
        dic[i] += 1
for key in dic:
    if dic[key]%2 ==1:
        print("No")
        exit()
print('Yes')

Submission status: Accepted

Solution code:
w = list(input())
w.sort()
i = 0
if len(w) % 2 == 1:
    print('No')
    exit()

while i < len(w)-1:
	if w[i] != w[i+1]:
		print('No')
		exit()
	i += 2
else:
	print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
w = input()
d = {}
bl = True

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

for k, v in d.items():
    bl = bl and v%2==0

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

Submission status: Accepted

Solution code:
from collections import Counter

w = list(input())
C = Counter(w)

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

Submission status: Accepted

Solution code:
S = list(input())
A = []
for i in S:
  if i in A:
    A.remove(i)
  else:
    A.append(i)
if len(A) == 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
w = str(input())
flag = 0

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  string = input()
  flg=0
  while len(string)!=0:
    if(string.count(string[0])%2==0):
      string=string.replace(string[0],'')
    else:
      flg=1
      break
  if flg==0:
    print('Yes')
  else:
    print('No')  
main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
from string import ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    w = input()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import exit

w = input()

d = dict()
for letter in w:
  d[letter] = d.get(letter, 0) + 1
  
for key in d:
  if d[key] % 2:
    print("No")
    exit()
    
print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
w = input()
print(['Yes', 'No'][any(w.count(c) % 2 for c in set(w))])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
count = {}
for c in input():
    if c in count:
        count[c] = not(count[c])
    else:
        count[c] = False

print(['Yes', 'No'][False in count.values()])

Submission status: Accepted

Solution code:
a =list(input())

from collections import Counter
a=Counter(a)

for i in a.items():
    if i[1]%2 != 0:
        print('No')
        exit()

print('Yes')

Submission status: Accepted

Solution code:
W=input()

ans='Yes'
A='abcdefghijklmnopqrstuvwxyz'
i=0
while i<26:
    if W.count(A[i])%2==1:
        ans='No'
    i+=1

print(ans)

Submission status: Accepted

Solution code:
s=str(input())
s=list(s)
sset=set(s)
sset=list(sset)
for i in range(0,len(sset)):
  temp=s.count(sset[i])
  if temp%2!=0:
    print("No")
    break
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter


def main():
    w = input()
    x = Counter(w)
    for c, n in x.items():
        if n % 2:
            print('No')
            return
    print('Yes')
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter
w = input()
w = list(w)
s = Counter(w)
n = 0
for i in s.values():
    if i % 2 == 0:
        n += int(i/2)
        
if len(w)/2 == n:
    print("Yes")
    
else:
    print("No")

Submission status: Accepted

Solution code:
from collections import defaultdict

w = list(input())

alphabet_count_dict = defaultdict(int)

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

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

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

def S(): return stdin.readline().rstrip()
def I(): return int(stdin.readline().rstrip())
def LS(): return list(stdin.readline().rstrip().split())
def LI(): return list(map(int,stdin.readline().rstrip().split()))

w = S()

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

print('Yes')

Submission status: Accepted

Solution code:
import math
import copy

neko = "Yes"
w = input()
for a in ['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']:
    nya = len(w)
    if (nya-len(w.replace(a,'')))%2:
        neko = "No"
        break
print(neko)

Submission status: Accepted

Solution code:
from collections import Counter
l=[]
count=0
l=list(input())
for i in Counter(l).values():
    if i%2==1:
        count+=1
if count!=0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
w = input()
ww = set(w)
check = []
ans = 0

for i in ww:
    check.append(w.count(i))

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

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:
from sys import exit

w = input()
n = len(w)

cnt = [0]
c = w[0]
sw = sorted(w)
for i in range(n):
    if sw[i] == c:
        cnt[-1] += 1
    else:
        c = sw[i]
        cnt.append(1)
for i in range(len(cnt)):
    if cnt[i]%2 == 1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
import numpy as np

w = list(map(str, input().rstrip()))
x = np.array(list(Counter(w).values()))

print("Yes") if np.mod(x, 2).sum()==0 else print("No")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

def main():
    ans = 'Yes'
    w = input().rstrip('\n')
    s = set(w)
    for i in s:
        if w.count(i)%2 != 0:
            ans = 'No'
            break
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = [0]*26
s = input()
for i in range(len(s)) :
	a[ord(s[i])-ord('a')] += 1
cek = True
for i in range(len(a)) :
	if a[i] % 2 == 1:
		cek = False
		break
if (cek) :
	print("Yes")
else :
	print("No")

Submission status: Accepted

Solution code:
ss = input()

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

for s in ss:
    ll[s] += 1

for l in ll.keys():
    if ll[l] % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
def cin():
	return map(int,input().split())

def cino(test=False):
    if not test:
        return int(input())
    else:
        return input()
def cina():
  return list(map(int,input().split()))

def hashing(my_list):   
    freq = {} 
    for item in my_list: 
        if (item in freq): 
            freq[item] += 1
        else: 
            freq[item] = 1  
    return freq

a = cino(True)
a = list(a)
h = hashing(a)
check = False
for key, value in h.items():
    if value%2!=0:
        check = True
        break
if check:
    print("No")
else:
    print("Yes")

# print(ans)
# a = list(a)
# has = {}
# x,y = -1,-1
# for i in range(len(a)):
#     has[a[i]]=[0,0]

# for i in range(len(a)):
#     has[a[i]][0] += 1
#     if has[a[i]][0]==1:
#         has[a[i]][1] = i
#     temp1 = has[a[i]][0]
#     # print(temp1)
#     if i>2 and temp1>2:
#         temp = has[a[i]][1]
#         if temp1>(i-temp)//2:
#             x,y = temp+1,i+1
#             break
# print(x,y)

Submission status: Accepted

Solution code:
buf = input()
d = {}
for s in buf:
    if (s in d) == False:
        d[s] = 1
    else:
        d[s] += 1
nums = d.values()
oddExist = False
for num in nums:
    if num % 2 != 0:
        oddExist = True
if oddExist == False:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = [0] * 26
word = 'Yes'
for i in w:
  ans[alpha.index(i)] += 1

for i in ans:
  if i % 2 == 0:
    pass
  else:
    word = 'No'
    break

print(word)

Submission status: Accepted

Solution code:
w = input()
word_count = {c:w.count(c) for c in set(w)}
flg = True
for count in word_count.values():
    if count % 2:
        flg = False

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

Submission status: Accepted

Solution code:
w = input()
wl = []
for i in range(len(w)):
    wl.append(w[i])

from collections import Counter
W = Counter(wl)

answer = 'Yes'
for i in range(len(w)):
    if W[w[i]]%2 != 0:
        answer = 'No'
        break
        
print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(map(input().count,"abcdefghijklmnopqrstuvwxyz"))
ng=False
for x in a:
  if x%2: ng=True
print("YNeos"[ng::2])

Submission status: Accepted

Solution code:
w = str(input())

w = sorted(w)
check = list(sorted(set(w)))

for i in range(len(check)):
    if w.count(check[i])%2 == 1:
        print("No")
        exit()

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
s = 'a'

ans = 'Yes'

for i in range(26):
    if w.count(s) % 2 != 0:
        ans = 'No'
        break

    s = chr(ord(s) + 1)

print(ans)

Submission status: Accepted

Solution code:
#print#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
from collections import Counter
def resolve():
    w=input()
    a=Counter(w)
    for j in a.values():
        if j%2:print("No");return
    print("Yes")
#%%submit!    
resolve()

Submission status: Accepted

Solution code:
w = input()
a = "abcdefghijklmnopqrstuvwxyz"
w_list = list(a)
hoge = 0
for word in w_list:
  s = w.count(word)
  if s%2 != 0:
    print('No')
    hoge += 1
    break
if hoge == 0:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = input()
result = "Yes"
abc = (set(word))
abc = "".join(abc)
for i in abc:
    
    if word.count(i) %2 ==1:
        result = "No"
        break
        
print(result)

Submission status: Accepted

Solution code:
s = input()

lAlp = [0 for i in range(26)]

for i in range(len(s)):
    num = ord(s[i]) - ord('a')
    lAlp[num] += 1
    
for i in range(26):
    if(lAlp[i] % 2 == 1):
        print('No')
        break

else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w=input()
ans={}
k=0
for i in w:
    if i not in ans:
        ans[i]=1
    else :
        ans[i]+=1
for i in ans:
    if ans[i]%2==1:
        print("No")
        break
else :
    print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter

s = list(input())

c = Counter(s)

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

Submission status: Accepted

Solution code:
from collections import defaultdict

w = input()
d = defaultdict(int)
for s in w:
    d[s] += 1

for _, v in d.items():
    if v % 2 == 1:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

Solution code:
import collections

dic = collections.Counter(list(input()))
for i, v in dic.items():
  if v % 2 != 0:
    print('No')
    break
else:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w=input()
dic = {
  'a': 0,
  'b': 0,
  'c': 0,
  'd': 0,
  'e': 0,
  'f': 0,
  'g': 0,
  'h': 0,
  'i': 0,
  'j': 0,
  'k': 0,
  'l': 0,
  'm': 0,
  'n': 0,
  'o': 0,
  'p': 0,
  'q': 0,
  'r': 0,
  's': 0,
  't': 0,
  'u': 0,
  'v': 0,
  'w': 0,
  'x': 0,
  'y': 0,
  'z': 0
}
for i in w:
  dic[i] +=1

flg=True
for key in dic:
  if dic[key] != 0 and dic[key] % 2 != 0:
    flg=False
print('Yes' if flg else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()
List = []
for k in range(len(w)):
  tmp = w[k]
  List.append(tmp)
num2alpha = lambda c: chr(c+96)
for i in range(1,27):
  tmp2 = List.count(num2alpha(i))
  if(tmp2 % 2 == 0):
    pass
  else:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
from collections import defaultdict


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import Counter

s=list(input())
c = Counter(s)
ans = "Yes"
for _,i in c.items():
    if i % 2 != 0:
        ans = "No"

print(ans)

Submission status: Accepted

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

dic = Counter(w)
#print(dic.values())

flag = 1
for val in dic.values():
  if val % 2 != 0:
    flag = 0
    break
if flag == 0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

x = list()
num = list()
y = 0
for a in w:
    judge = 0
    i = 0
    while i<y:
        if a == x[i]:
            num[i] += 1
            judge = 1
            break
        i += 1
    if judge == 0:
        x.append(a)
        y += 1
        num.append(1)

i = 0
ans = "Yes"
while i<y:
    if (num[i] %2)!= 0:
        ans = "No"
    i+=1

print(ans)