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

Solution (Python):
w = input()
al = dict([(chr(i),0) for i in range(97, 97+26)])
for i in range(len(w)):
    al[w[i]] += 1
for keys,valuse in al.items():
    if valuse%2 != 0:
        print("No")
        quit()
print("Yes")

Solution (Python):
w = list(input())
cnt = [0]*26
for wi in w:
    index = ord(wi)-ord("a")
    cnt[index] += 1
    
for i in range(26):
    if cnt[i]%2!=0:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False



dp = None


def main():
    S = input()

    for s in set(S):
        if S.count(s) % 2 != 0:
            print("No")
            return
    
    print("Yes")


main()

Solution (Python):
from collections import Counter

w = input()

counter = Counter(w)
bell = 'Yes'

for v in counter.values():
	if v%2==1: 
		bell = 'No'
		break

print(bell)

Solution (Python):
from collections import Counter

w = input()

counter = Counter(w)
bell = 'Yes'

for v in counter.values():
	if v%2==1: 
		bell = 'No'
		break

print(bell)

Solution (Python):
w = list(input())
a = list(set(w))

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

Solution (Python):
w=input()
for X 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"]:
    if int(w.count(X))%2==1:
        print("No")
        break
else:
    print("Yes")

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

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

Solution (Python):

import sys
from collections import Counter

w = list(input())

c = Counter(w)

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

Solution (Python):
a = list(input())
b = list(set(a))

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

Solution (Python):

w = input()
print("Yes" if all(w.count(s)%2==0 for s in w) else "No")

Solution (Python):

w = input()
print("No" if any(w.count(s)%2 for s in w) else "Yes")

Solution (Python):

w = input()
print("No" if sum(w.count(s)%2 for s in w) else "Yes")

Solution (Python):

w = input()

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

Solution (Python):

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

Solution (Python):
w = raw_input()
l = set([])
for i in w:
    if i in l:
        l.remove(i)
    else:
        l.add(i)
if l == set([]):
    print "Yes"
else:
    print "No"

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

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

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

Solution (Python):
s = input()

if all(s.count(c) % 2 == 0 for c in set(s)):
  print('Yes')
else:
  print('No')

Solution (Python):
w = input()
for i in 'abcdefghijklmnopqrstuvwxyz':
    n = w.count(i)
    if n % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w = list(input())
w_num = {}

for i in w:
    if i in w_num.keys():
        w_num[i] += 1
    else:
        w_num[i] = 0
        w_num[i] += 1

flag = True
for value in w_num.values():
    if value % 2 == 1:
        flag = False
        break

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

Solution (Python):
w = list(input())

isBeautiful = True
for i in w:
    if w.count(i) % 2 is not 0:
        isBeautiful = False

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

Solution (Python):
w = input()
dif = ord('z') - ord('a')
flg = True
for i in range(dif + 1):
    cnt = w.count(chr(ord('a')+i))
    if cnt % 2 == 1:
        flg = False
print("Yes") if flg == True else print("No")

Solution (Python):
w=input()
flag="Yes"
for i in range (len(w)):
    if w.count(w[i])%2!=0:
        flag="No"
        break

print(flag)

Solution (Python):
import collections
w=collections.Counter(list(input()))
w=[x%2 for x in w.values()]
if not 1 in w:
    print('Yes')
else:
    print('No')

Solution (Python):
a=sorted(list(input()))
b=[]
c=[]
d=0
if len(a)%2==0:
    for i in range(len(a)//2):
        b.append(a[2*i])
        c.append(a[2*i+1])
    for j in range(len(b)):
        if b[j]==c[j]:
            d+=1
    if d==len(a)//2:
        print("Yes")
    else:
        print("No")
else:
    print("No")

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

Solution (Python):
w = input()

for i in w:
  count = 0
  for j in w:
    if i == j:
      count += 1
  if count % 2 != 0:
    print('No')
    exit()
print('Yes')

Solution (Python):
from collections import Counter


def main():
    w = input()
    cnt = list(Counter(w).values())
    s = list(filter(lambda x: x % 2 != 0, cnt))
    print("Yes" if len(s) == 0 else "No")


if __name__ == '__main__':
    main()

Solution (Python):
sS = input().strip()

d = {}
for s in sS:
    if s in d:
        d[s]+=1
    else:
        d[s] = 1
for k,v in d.items():
    if v % 2 == 1:
        print("No")
        exit()
print( "Yes")

Solution (Python):
from sys import stdin


def main():
    w = next_str()
    dic = dict()

    ans = "Yes"

    for v in w:
        if v not in dic:
            dic[v] = 0

        dic[v] += 1

    for v in dic.values():
        if v % 2 != 0:
            ans = "No"
            break

    print(ans)


def next_str():
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
alp = ['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 i in alp:
        if s.count(i)%2 != 0:
                print('No')
                break
else:
        print('Yes')

Solution (Python):
W = input()

import collections

switch = 0
W_list = list(W)
W_dic = collections.Counter(W_list)
for num in W_dic.values():
    if num%2 != 0:
        switch = 1
        break

if switch == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
a = list(input())
br = []
for ar in a:
    br.append(a.count(ar))
x = 0
for b in br:
    if b % 2 == 1:
        x += 1
if x == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
w=input()
list1=[]
for i in range(len(w)):
    if w[i] in list1:
        pass
    else:
        if w.count(w[i])%2==0:
            list1.append(w[i])
        else:
            print("No")
            exit()
print("Yes")

Solution (Python):
def main():
    s = []
    for i in input():
        s.append(i)
    alpha = [chr(i) for i in range(97, 97 + 26)]
    for a in alpha:
        if s.count(a) % 2 != 0:
            print("No")
            return
    print("Yes")


if __name__ == "__main__":
    main()

Solution (Python):

from sys import stdin

s = stdin.readline().rstrip()
s_unique = list(set(s))
counter = [0 for i in range(len(s_unique))]

for i in range(len(s)):
    for j in range(len(s_unique)):
        if s[i] == s_unique[j]:
            counter[j] += 1
            break

for i in range(len(counter)):
    if counter[i] % 2:
        print("No")
        exit()
print("Yes")

Solution (Python):
W = input()
from collections import defaultdict
C = defaultdict(int)
for w in W: C[w] += 1
for k, v in C.items():
    if v % 2:
        print('No')
        break
else:
    print('Yes')

Solution (Python):



"""
collectionsを使わないタイプ

制約
    1≤|w|≤100
    w は英小文字 (a-z) のみからなる文字列である。
"""

import collections
test_mode = False
use_Counter = True    


def judge_0(l):
    """
    collections.Counter を使うタイプ
    奇数会出現する要素があると False を返し、
    全ての要素が偶数回出現すると True を返す。
    """
    count_l = collections.Counter(l)    

    if test_mode:
        print(count_l)

    for i in count_l:
        if count_l[i] % 2 == 1:
            if test_mode:
                print('break')
            return False

    return True


def judge_1(l):
    """
    collections.Counter を使わないタイプ
    奇数会出現する要素があると False を返し、
    全ての要素が偶数回出現すると True を返す。
    """

    for i in l:
        if test_mode:
            print('{}:'.format(i), l.count(i))
            if l.count(i) % 2 == 1:
                print('break')
        if l.count(i) % 2 == 1:
            return False

    return True



def main():
    """
    main関数
    """
    w = list(str(input()))  
    if use_Counter:
        beautiful = judge_0(w)
    else:
        beautiful = judge_1(w)

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



if __name__ == '__main__':
    main()

Solution (Python):



"""
collectionsを使わないタイプ

制約
    1≤|w|≤100
    w は英小文字 (a-z) のみからなる文字列である。
"""

import collections
test_mode = False
use_Counter = False    


def judge_0(l):
    """
    collections.Counter を使うタイプ
    奇数会出現する要素があると False を返し、
    全ての要素が偶数回出現すると True を返す。
    """
    broken = False
    count_l = collections.Counter(l)    

    if test_mode:
        print(count_l)

    for i in count_l:
        if count_l[i] % 2 == 1:
            if test_mode:
                print('break')
            broken = True
            break

    return not broken


def judge_1(l):
    """
    collections.Counter を使わないタイプ
    奇数会出現する要素があると False を返し、
    全ての要素が偶数回出現すると True を返す。
    """
    broken = False  

    for i in l:
        if test_mode:
            print('{}:'.format(i), l.count(i))
            if l.count(i) % 2 == 1:
                print('break')
        if l.count(i) % 2 == 1:
            broken = True
            break

    return not broken



def main():
    """
    main関数
    """
    w = list(str(input()))  
    if use_Counter:
        beautiful = judge_0(w)
    else:
        beautiful = judge_1(w)

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



if __name__ == '__main__':
    main()

Solution (Python):



"""
collectionsを使わないタイプ

制約
    1≤|w|≤100
    w は英小文字 (a-z) のみからなる文字列である。
"""

import collections
test_mode = False
use_Counter = True    


def judge_0(l):
    """
    collections.Counter を使うタイプ
    奇数会出現する要素があると False を返し、
    全ての要素が偶数回出現すると True を返す。
    """
    broken = False
    count_l = collections.Counter(l)    

    if test_mode:
        print(count_l)

    for i in count_l:
        if count_l[i] % 2 == 1:
            if test_mode:
                print('break')
            broken = True
            break

    return not broken


def judge_1(l):
    """
    collections.Counter を使わないタイプ
    奇数会出現する要素があると False を返し、
    全ての要素が偶数回出現すると True を返す。
    """
    broken = False  

    for i in l:
        if test_mode:
            print('{}:'.format(i), l.count(i))
            if l.count(i) % 2 == 1:
                print('break')
        if l.count(i) % 2 == 1:
            broken = True
            break

    return not broken



def main():
    """
    main関数
    """
    w = list(str(input()))  
    if use_Counter:
        beautiful = judge_0(w)
    else:
        beautiful = judge_1(w)

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



if __name__ == '__main__':
    main()

Solution (Python):
w = input()
a = list(set(w))
for s in a:
    if w.count(s) % 2:
        print("No")
        exit()
print("Yes")

Solution (Python):
sl = [i for i in input()]
s_s = set(sl)
r = ""
for s in s_s:
  if sl.count(s) % 2 == 0:
    r = "Yes"
  else:
    r = "No"
    break
print(r)

Solution (Python):
import collections

w = input()
W = collections.Counter(w).values()

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

Solution (Python):
import collections
w = list(input())
w = collections.Counter(w)
w_count = w.most_common()
flag = 0

for i in range(len(w_count)):
    if int(w_count[i][1]) % 2 == 1:
        flag = 1

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

Solution (Python):
import collections
w = collections.Counter(list(input()))
c = [k%2 for k in w.values()]
print("No" if 1 in c else "Yes")

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    c = Counter(input())
    for k, v in c.items():
        if v % 2 != 0:
            print(No)
            return
    print(Yes)


if __name__ == '__main__':
    main()

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

Solution (Python):
w = str(input())
w_list = list(w)
for letter in set(w_list):
    if w_list.count(letter) % 2 == 1:
        print("No")
        break
    else:
        continue

else:
    print("Yes")

Solution (Python):
w=input();print("YNeos"[sum(w.count(c)%2for c in w)>0::2])

Solution (Python):
s=input();c=[0]*26;f=0
for i in s:c[ord(i)-97]+=1
for i in c:f+=i%2
print("YNeos"[f>0::2])

Solution (Python):
s=input();c=[0]*26;f=0
for i in s:c[ord(i)-97]+=1
for i in c:f+=i%2
print("YNeos"[(f>0)::2])

Solution (Python):
w = input()

num = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]

for i in range(len(w)):
    if w[i] == 'a':
        num[0] += 1

    elif w[i] == 'b':
        num[1] += 1

    elif w[i] == 'c':
        num[2] += 1

    elif w[i] == 'd':
        num[3] += 1

    elif w[i] == 'e':
        num[4] += 1

    elif w[i] == 'f':
        num[5] += 1

    elif w[i] == 'g':
        num[6] += 1

    elif w[i] == 'h':
        num[7] += 1

    elif w[i] == 'i':
        num[8] += 1

    elif w[i] == 'j':
        num[9] += 1

    elif w[i] == 'k':
        num[10] += 1

    elif w[i] == 'l':
        num[11] += 1

    elif w[i] == 'm':
        num[12] += 1

    elif w[i] == 'n':
        num[13] += 1

    elif w[i] == 'o':
        num[14] += 1

    elif w[i] == 'p':
        num[15] += 1

    elif w[i] == 'q':
        num[16] += 1

    elif w[i] == 'r':
        num[17] += 1

    elif w[i] == 's':
        num[18] += 1

    elif w[i] == 't':
        num[19] += 1

    elif w[i] == 'u':
        num[20] += 1

    elif w[i] == 'v':
        num[21] += 1

    elif w[i] == 'w':
        num[22] += 1

    elif w[i] == 'x':
        num[23] += 1

    elif w[i] == 'y':
        num[24] += 1

    elif w[i] == 'z':
        num[25] += 1

ans = "Yes"

for i in range(len(num)):
    if num[i] % 2 == 1:
        ans = "No"
        break

print(ans)

Solution (Python):
a=input()
for x in(a):
    if a.count(x)&1:print('No');exit()
print('Yes')

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

Solution (Python):
w = list(input())
alphabet = ["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"]
i = 0
while i <= 25:
    if w.count(alphabet[i]) % 2 == 1:
        print("No")
        break
    i += 1
else:
    print("Yes")

Solution (Python):
w = input()
l = [0]*len(w)
for i,s in enumerate(w):
    for j in range(len(w)):
        if w[j]==s:
             l[i] += 1

for i in l:
    if i%2!=0:
        print('No')
        import sys
        sys.exit()
print('Yes')

Solution (Python):
def check(ar):
    for i in ar:
        if i%2 != 0: return False
    return True

w = input()
  
a = 'abcdefghijklmnopqrstuvwxyz'
ar = [0]*26

for c in w:
    ar[a.find(c)] += 1

if check(ar): print('Yes')
else: print('No')

Solution (Python):
word = input()
answer = 'Yes'
for ch in map(chr, range(97, 123)):
    if word.count(ch) % 2 != 0:
        answer = 'No'
        break
print(answer)

Solution (Python):
w = input()
answer = 'Yes'
for c in map(chr, range(97, 123)):
    if c in w:
        if w.count(c) % 2 != 0:
            answer = 'No'
            break
print(answer)

Solution (Python):
W = input()

dic = {}

for ch in W:
  if ch in dic:
    dic[ch] += 1
  else:
    dic[ch] = 1
  
ans = True
for k,v in dic.items():
  if v%2 != 0:
    ans = False
    break
    
print("Yes" if ans else "No")

Solution (Python):
import sys
w=input()
for i in range(len(w)):
    if w.count(w[i])%2==0:
        pass
    else:
        print('No')
        sys.exit()
print('Yes')

Solution (Python):
w = input()
abc = 'abcdefghijklmnopqrstuvwxyz'
dic = {}
for s in abc:
    dic[s] = 0

for s in w:
    dic[s] += 1
ch = 0
for s in abc:
    if dic[s]%2 != 0:
        ch = 1
if ch == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
w = input()
a = 0
for wi in w:
    a ^= ord(wi)

if a == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
wlist = [0 for i in range(26)]
w = list(input())
for i in w:
    wlist[ord(i) - 97] += 1
ans = 1
for i in wlist:
    if i % 2 != 0:
        print("No")
        ans = -1
        break
if ans == 1:
    print("Yes")

Solution (Python):
w = input()

def is_beutifull_str(char_str):
    for s in w:
        if w.count(s)%2 == 1:
            return 'No'
    return 'Yes'

print (is_beutifull_str(w))

Solution (Python):
w = list(input())
S = set(w)
L = []
T = sorted(S)
for i in range(0,len(S)):
  L.append(w.count(T[i]))

flag = True  
for a in L:
  if (a % 2 != 0):
    flag = False
    
if flag:
  print('Yes')
else:
  print('No')

Solution (Python):
w = input()

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

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

Solution (Python):
from collections import Counter

w = Counter(list(input()))

for value in w.values():
    if value % 2 != 0:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
a=input()
b=''
for x in a:
    if int(x in b)==1:b=b.replace(x,'')
    else:b=b+x
if b=='':print('Yes')
else:print('No')

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

Solution (Python):
w=input()
a="abcdefghijklmnopqrstuvwxyz"
for i in range(26):
    if w.count(a[i]) % 2 !=0:
        print("No")
        exit()
print("Yes")

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

Solution (Python):
w=input()
for c in w:
    if w.count(c)%2:
        print('No')
        exit()
print('Yes')

Solution (Python):
w = input()
print("No" if sum(w.count(c) % 2 for c in set(w)) else "Yes")

Solution (Python):
w = input()
print("No" if sum(w.count(c)%2for c in w) else "Yes")

Solution (Python):
w=input();print("YNeos"[sum(w.count(c)%2for c in w)!=0::2])

Solution (Python):
w=input()
print("YNeos"[sum(w.count(c)%2for c in w)!=0::2])

Solution (Python):
a=input()
lis=set(a)
li = []
for i in lis:
    if a.count(i) % 2 == 0:
        li.append(a.count(i))
print("Yes" if sum(li)==len(a) else "No")

Solution (Python):
w=input()
print("YNeos"[sum(map(lambda x:w.count(x)%2,w))!=0::2])

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

Solution (Python):
m = {}
for x in input():
    if x in m:
        m[x] += 1
    else:
        m[x] = 1

lst = [x % 2 for x in m.values()]
if lst.count(1) > 0:
    print("No")
else:
    print("Yes")

Solution (Python):
s={}
for i in input():
    s[i]=s.get(i,0)+1
for i in s.values():
    if i%2!=0:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
w = input()

a = [chr(ord('a') + i) for i in range(26)]
b = []

for i in w:
    b.append(i)

flag = 0

for i in a:
    if b.count(i) % 2 == 1:
        flag = 1
        break

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

Solution (Python):
w=input()
mp={"tmp":0}

for c in w:
	if c in mp:
		mp[c]+=1
	else:
		mp[c]=1
res=True
for v in mp.values():
	if v%2!=0:
		res=False
		break
print("Yes" if res else "No")

Solution (Python):
from collections import Counter

w = input()

cnt = Counter(w)

isBeautiful = True
for v in cnt.values():
    if v%2 == 1:
        isBeautiful = False
        
if isBeautiful:
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter
w = input()
ctr = Counter(w)
for v in ctr.values():
    if v%2:
        print('No')
        exit()
print('Yes')

Solution (Python):

from collections import Counter

def main():
    w = list(input())
    counter = Counter(w)
    for c in set(w):
        if counter[c] % 2 != 0:
            print('No')
            exit()
    print('Yes')

if __name__ == '__main__':
    main()

Solution (Python):
text = input()
judge = 0
for i in set(text):
    if text.count(i) % 2 == 0:judge += 1
print("Yes" if judge == len(set(text)) else "No")

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

Solution (Python):

w = input()
w = sorted(w)
ans = True

if len(w)% 2!=0:
    ans = False

else:
    for i in range (len(w)//2):
        if w[2*i] == w[2*i+1]:
            ans = True
        else:
            ans = False
            break
print('Yes' if ans == True else 'No')

Solution (Python):
w = input()
syuugou = set(w)

for i in syuugou:
  kosuu = w.count(i)
  if kosuu % 2 == 0:
    continue
  else:
    print("No")
    break
else:
  print("Yes")

Solution (Python):
w = input()
alpha_dic = {}
for i in range(97,97+26):
    alpha_dic[chr(i)] = 0
for character in w:
    alpha_dic[character] +=1
counter = 0
for key in alpha_dic:
    if alpha_dic[key]%2 == 0:
        counter += 1
    else:
        print('No')
        break
if counter == 26:
    print('Yes')

Solution (Python):
w=input()
x={}
for s in w:
    if s in x.keys():
        x[s]+=1
    else:
        x[s]=1
f=False
for v in x.values():
    if v%2==1:
        print('No')
        f=True
        break
if not(f):
    print('Yes')

Solution (Python):
w=input()
x={}
for s in w:
    if s in x.keys():
        x[s]+=1
    else:
        x[s]=1
for v in x.values():
    if v%2==1:
        print('No')
        exit()
print('Yes')

Solution (Python):
from collections import Counter as c

d=c(input())
if not list(filter(lambda x:x%2, d.values())):
  print("Yes")
else:
  print("No")

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

Solution (Python):
import collections
w = collections.Counter(input())

for i in w.values():
    if i%2==0:
        pass
    else:
        print('No')
        exit()
print('Yes')

Solution (Python):
s=list(input())

s.sort()

n=len(s)

c=1
f=1
now=s[0]

for i in range(1,n):
    if now==s[i]:
        c+=1
    else:
        if c%2==1:
            f=-1
        c=1
        now=s[i]
else:
    if c%2==1:
        f=-1

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

Solution (Python):
s=list(input())

s.sort()

n=len(s)

c=1
f=1
now=s[0]

for i in range(1,n):
    if now==s[i]:
        c+=1
    else:
        if c%2==1:
            f=-1
        c=1
        now=s[i]
else:
    if c%2==1:
        f=-1

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

Solution (Python):
w = input()

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

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

Solution (Python):
alphabet = [chr(c+ord('a')) for c in range(26)]
s = input()
flag = True
for c in alphabet:
  if s.count(c)%2:
    flag = False
    break
print('Yes' if flag else 'No')

Solution (Python):
w = input()
d = {}
for s in set(w):
  d[s] = 0
for s in w:
  d[s] += 1
ans = True
for s, n in d.items():
  if n % 2:
    ans = False
    break
print('Yes' if ans else 'No')

Solution (Python):
def main():
    w = list(input())

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

    print("Yes")

if __name__ == "__main__":
        main()

Solution (Python):
w = input()
d = {}
for x in w:
    d[x] = d.get(x, 0) + 1
print("Yes" if all(map(lambda x: 0 == (x % 2), d.values())) else "No")

Solution (Python):
from collections import Counter

w = input()

c = Counter(w)
ans = 'Yes'
for v in c.values():
    if v % 2 == 1:
        ans = 'No'
        break
print(ans)

Solution (Python):
from collections import Counter
c = Counter(input())
for v in c.values():
    if v % 2 == 1:
        print('No')
        exit()
print('Yes')

Solution (Python):
from collections import Counter
import sys

w = input()
count_L = Counter(w)
for i in count_L.items():
    if i[1] % 2 != 0:
        print("No")
        sys.exit()

print("Yes")

Solution (Python):
w = input()
d = {}
for i in range(len(w)):
    if w[i] in d.keys():
        d[w[i]] += 1
    else:
        d[w[i]] = 1
flg = True
for v in d.values():
    if v % 2 != 0:
        flg = False
        break
print('Yes' if flg else 'No')

Solution (Python):
w = str(input())
ar = []
a = 0

for j in range(97, 123):
    b = w.count(chr(j))
    if b %2 == 1:
        print("No")
        a = 0
        break

    else:
        a = 1
if a == 1:
    print("Yes")

Solution (Python):
w = list(input())
N = len(w)
w.sort()
for i in range(int(N // 2)):
	if w[0] == w[1]:
		w.remove(w[0])
		w.remove(w[0])

if w == []:
	print("Yes")
else:
	print("No")

Solution (Python):
w=input()
for c in 'abcdefghijklmnopqrstuvwxyz':
    if w.count(c)%2:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
w = input()
d = {}
for ww in w:
    if ww not in d.keys():
        d[ww] = 1
    else:
        d[ww] += 1

def solve(d):
    for key, item in d.items():
        if item%2 == 1:
            print('No')
            return
        
    print('Yes')
    return

solve(d)

Solution (Python):
import collections
s=input()
c = collections.Counter(s)
res='Yes'
for k in c:
    if c[k] % 2 != 0:
        res='No'
        break
print(res)

Solution (Python):
w = input()

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

ans ='Yes'

for v in dic.values():
    if v % 2 != 0:
        ans = 'No'
        break

print(ans)

Solution (Python):
def init_d():
    d = {'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}
    return d

W = input()

d = init_d()
n = len(W)
for i in range(n):
    d[W[i]] += 1

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

Solution (Python):
w=input()
for c in 'abcdefghijklmnopqrstuvwxyz':
    if w.count(c)%2:
        print('No')
        break
else:
    print('Yes')

Solution (Python):
s=[chr(i) for i in range(97,123)]
N=list(input())
for i in s:
    p=N.count(i)
    if p%2!=0:
        print("No")
        break
else:
    print("Yes")

Solution (Python):


w = input()
A = {}
for i in w:
    if i not in A:
        A[i] = 1
    else:
        A[i] += 1
for a in A.keys():
    if A[a] % 2 != 0:
        print('No')
        exit()
print('Yes')

Solution (Python):
from collections import Counter
s=Counter(input())
for i in s:
    if s[i]%2==1:
        print('No')
        break
else:print('Yes')

Solution (Python):


from collections import Counter 

w = list(input())


str_dict = Counter(w)

for key, value in str_dict.items():
    if value % 2 != 0:
        print("No")
        exit()
print("Yes")

Solution (Python):
w=input()
import collections
c=collections.Counter(w)
t=0
for x in c.values():
    if x%2!=0:
        t+=1
print('No' if t else 'Yes')