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:
w = input()
from collections import Counter
wc = Counter(w)

for c in wc.values():
    if c%2 == 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
a = input()
dic = {}
for i in a:
    if i in dic:
        dic[i] += 1
    else:
        dic[i] = 1
for i in dic:
    if dic[i] % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()

w_list = [a for a in w]
w_set = set(w_list)

ans = 'Yes'
for i in w_set:
    if w_list.count(i)%2 != 0:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

dic = {}
for c in w:
    if c not in dic:
        dic[c] = 1
    else:
        dic[c] += 1
        
for key in dic:
    if dic[key] % 2 != 0:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
wl = []

for i in range(len(w)):
  wl.append(w[i])
  
wl.sort()

a = 1
judge = 1
if len(w)%2 == 0:
  for n in range(len(w)-1):
    if wl[a+n] == wl[a+n-1]:
      judge += 1
    else:
      if judge%2 != 0:
        print("No")
        exit()
      else:
        judge = 1
    if n == len(w)-2:
      if judge%2 == 0:
        print("Yes")
      else:
        print("No")
else:
  print("No")

Submission status: Accepted

Solution code:
s = input()
d = {}
for i in range(len(s)):
    if s[i] in d:
        d[s[i]] += 1
    else:
        d[s[i]] = 1
for v in d.values():
    if v % 2:
        print('No')
        exit()
print('Yes')

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    S = input().rstrip()
    s_dict={}

    for s in S:
        if s not in s_dict:
            tmp={s:1}
            s_dict.update(tmp)
        else:
            count=s_dict[s]
            count+=1
            s_dict[s]=count
    
    for i,v in s_dict.items():
        if v % 2 !=0:
            print("No")
            exit()
        else:
            continue        
    print("Yes")
if __name__=="__main__":
    main()

Submission status: Accepted

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

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:
import collections
S = list(input())
D = collections.Counter(S)
ans = 'Yes'

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

print(ans)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
w = input()

d = {}

for i in list(w):
    if i not in d.keys():
        d[i] = 1
    else:
        d[i] += 1

ans = 'Yes'
for _, v in d.items():
    if v%2 != 0:
        ans = 'No'
        break
print(ans)

Submission status: Accepted

Solution code:
import sys
import copy
import math
import itertools
import numpy as np
w = input()
for i in "abcdefghijklmnopqrstuvwxyz":
    if w.count(i)%2==1:
        print("No")
        sys.exit(0)

print("Yes")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
import collections
import bisect

def main():
    W = input()

    c = collections.Counter(W)
    for key in c.keys():
        if c[key] % 2 != 0:
            print('No')
            return
    print('Yes')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
w = input()
X = [0 for i in range(26)]
for i in range(len(w)):
  X[ord(w[i]) - 97] ^= 1
if sum(X) == 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
w=input()
S="abcdefghijklmnopqrstuvwxyz"

flag=True
for c in S:
    if w.count(c)%2==1:
        flag=False
if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
w = str(input())
data1 = []
for i in range(len(w)):
    data1.append(w[i])
    
data2 = []
for i in range(len(w)):
    if not w[i] in data2:
        data2.append(w[i])

error = 0
for x in data2:
    if data1.count(x) % 2 != 0:
        error += 1
        break

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

Submission status: Accepted

Solution code:
S = input()

P = set()
for s in S:
  if s not in P and S.count(s)%2 != 0:
    print("No")
    exit()
  P.add(s)
print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

w = input().strip()

from collections import Counter

c = Counter(w)

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

Submission status: Accepted

Solution code:
# import math
# import statistics
a=input()
#b,c=int(input()),int(input())
c=[]
for i in a:
    c.append(i)
#e1,e2 = map(int,input().split())
# f = list(map(int,input().split()))
#g = [input() for _ in range(a)]
# h = []
# for i in range(e1):
#     h.append(list(map(int,input().split())))
se=set(c)
c.sort()
count=1
res=[]
for i in range(len(c)-1):
    if c[i]==c[i+1]:
        count+=1
    else:
        if count%2==0:
            res.append(c[i])
        count=1
if count%2==0:
    res.append(c[-1])
if len(res)==len(se):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import collections

s = input()

c = collections.Counter(s)
    
v = list(c.values())

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

Submission status: Accepted

Solution code:
def main():
    w = input()
    lst = [0] * 26

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

    for num in lst:
        if num % 2 != 0:
            print("No")
            break
    else:
        print("Yes")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import string
w = input()
a_z = string.ascii_letters
for i in a_z:
    if w.count(i) & 1:
        print('No')
        sys.exit()
print('Yes')

Submission status: Accepted

Solution code:
w=sorted(input())
total=False
if len(w)==1:
    total=True
    print("No")
else:
    for i in range(0,len(w),2):
        if w[i]!=w[i+1]:
            print("No")
            total=True
            break
if total==False:
    print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter

W = input()
C = Counter(W)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
di = {}
for c in s:
  di[c] = 0
for c in s:
  di[c] +=1
  
is_beautiful = True
for c in s:
  if di[c] %2 ==1:
    is_beautiful = False

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

Submission status: Accepted

Solution code:
from collections import Counter
w = input()
cnt = Counter(w)
for key in cnt.keys():
    if cnt[key] % 2 == 1:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
import collections
w = input()
w = sorted(w)

if len(w) % 2 != 0:
    print('No')
    exit()
C = collections.Counter(w)

C = list(C.values())


for i in range(len(C)):
    if C[i] % 2 != 0:
        print('No')
        exit()

print('Yes')

Submission status: Accepted

Solution code:
w = input()
d = {}
for i in range(len(w)):
  if w[i] not in d.keys():
    d[w[i]] = 1
  else:
    d[w[i]] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
import sys
a=input()
b=[]

for i in a:
  b.append(i)
  
b.sort()
c=collections.Counter(b)
c=list(c.values())

for i in range(len(c)):
  if int(c[i])%2==0:
    q=0
  else:
    q=1
    print('No')
    sys.exit()
    
print('Yes')

Submission status: Accepted

Solution code:
n = input()
dic = 'abcdefghijklmnopqrstuvwxyz'
for i in range(26):
  if n.count(str(dic[i]))%2!=0:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.readline

D = {'a':0, 'b':1, 'c':2, 'd':3, 'e':4,
    'f':5, 'g':6, 'h':7, 'i':8, 'j':9,
    'k':10,'l':11,'m':12,'n':13,'o':14,
    'p':15,'q':16,'r':17,'s':18,'t':19,
    'u':20,'v':21,'w':22,'x':23,'y':24,'z':25}

W = list(input().strip())

T = [0] * 26

for w in W:
    T[D[w]] += 1

b = True
for i in range(26):
    if T[i]%2 == 1:
        b = False
        break
if b == True:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:

w = input()
s = set(list(w))

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    w = input()
    d = defaultdict(int)
    for c in w: d[c] += 1
    cond = True
    for key in d:
        if d[key] % 2 != 0:
            cond = False
            break
    if cond:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
w = input()
w_set = set(w)
d = {}
for i in w_set:
    d[i] = 0
for i in w:
    d[i] += 1

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

Submission status: Accepted

Solution code:
w = input()
w_set = set(w)
d = {}
for i in w_set:
    d[i] = 0
for i in w:
    d[i] += 1

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

Submission status: Accepted

Solution code:
w = input()
dic = {}
for i in range(len(w)):
    if w[i] not in dic.keys():
        dic[w[i]] = 1
    else:
        dic[w[i]] += 1
flag = True
for i in dic.keys():
    if dic[i]%2 != 0:
        flag = False
if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = list(input())
if all(s.count(x) % 2 == 0 for x in set(s)):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
from collections import Counter

w = Counter([c for c in input()])
if all([v % 2 == 0 for k, v in w.items()]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s=input();print('NYoe s'[all([s.count(i)%2==0 for i in s])::2])

Submission status: Accepted

Solution code:
s=input();print('NYoe s'[all([s.count(i)%2==0 for i in set(s)])::2])

Submission status: Accepted

Solution code:
s=[*input()];print('NYoe s'[all([s.count(i)%2==0 for i in set(s)])::2])

Submission status: Accepted

Solution code:
s=[*input()];print('NYoe s'[all([1 if s.count(i)%2==0 else 0 for i in set(s)])::2])

Submission status: Accepted

Solution code:
import collections as c
print('NYoe s'[all([1 if i%2==0 else 0 for i in c.Counter(input()).values()])::2])

Submission status: Accepted

Solution code:
import collections 

w = str(input())
x = collections.Counter(w)
n = 0

    
for i in x.values():
    if i % 2 ==0:
        n += 1
        continue
    

if n == len(x.values()):
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
w = list(input())

w.sort()

cnt = 1

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

if cnt % 2 == 1:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    from collections import Counter
    w = input()
    c = Counter(w)

    def judge():
        for key, val in c.items():
            if val % 2 == 1:
                return False

        return True

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
w = input()
bea = True

elements = set(list(w))
for element in elements:
    if w.count(element) % 2 != 0:
        print("No")
        bea = False
        break

if bea:
    print("Yes")

Submission status: Accepted

Solution code:
from collections import defaultdict as dd
def beautiful(s):
    D = dd(lambda:0)
    for c in s:
        D[c] += 1
    if any(d&1 for d in D.values()):
        return False
    else:
        return True

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

Submission status: Accepted

Solution code:
from collections import Counter

w=input()

d=Counter(w)

ans="Yes"

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

print(ans)

Submission status: Accepted

Solution code:
w = input()

dict_ = {}

for i in w:
    dict_.setdefault(i, 0)
    dict_[i] +=1

flg = True

for v in dict_.values():
    if v % 2 != 0:
        flg = False
        break
if flg:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()
d = {}
for i in s:
    if i not in d:
        d[i] = 1
    else:
        d[i] += 1

for i in d.values():
    if i & 1 != 0:
        print("No")
        break
else:
    print("Yes")

Submission status: Accepted

Solution code:
w=input()
data='abcdefghijklmnopqrstuvwxyz'
for i in range(26):
  if w.count(data[i])%2==0:
    continue
  else:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

Solution code:
w = input()
count=0
if(w.count("a")%2==0):
    if(w.count("b")%2==0):
        if(w.count("c")%2==0):
            if(w.count("d")%2==0):
                if(w.count("e")%2==0):
                    if(w.count("f")%2==0):
                        if(w.count("g")%2==0):
                            if(w.count("h")%2==0):
                                if(w.count("i")%2==0):
                                    if(w.count("j")%2==0):
                                        if(w.count("k")%2==0):
                                            if(w.count("l")%2==0):
                                                if(w.count("m")%2==0):
                                                    if(w.count("n")%2==0):
                                                        if(w.count("o")%2==0):
                                                            if(w.count("p")%2==0):
                                                                if(w.count("q")%2==0):
                                                                    if(w.count("r")%2==0):
                                                                        if(w.count("s")%2==0):
                                                                            if(w.count("t")%2==0):
                                                                                if(w.count("u")%2==0):
                                                                                    if(w.count("v")%2==0):
                                                                                        if(w.count("w")%2==0):
                                                                                            if(w.count("x")%2==0):
                                                                                                if(w.count("y")%2==0):
                                                                                                    if(w.count("z")%2==0):
                                                                                                        count=1
if(count==1):
    print("Yes")
if(count==0):
    print("No")

Submission status: Accepted

Solution code:
w = [w for w in input()]
w1 = sorted(w)
w2 = sorted(w1[::2]*2)
print('Yes' if w1 == w2 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

w = input()

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

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = input()

s = {}
for c in w:
    if c in s:
        s[c] += 1
    else:
        s[c] = 1
b = True
for k,v in s.items():
    b = b and v % 2 == 0

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

Submission status: Accepted

Solution code:
from collections import Counter

w=input()

d=Counter(w)

ans="Yes"
for i in d.values():
  if i%2!=0:
    ans="No"
    break

print(ans)

Submission status: Accepted

Solution code:
def solve():
    w = list(input())
    s = set(w)
    for i in s:
        if len([x for x in w if x == i]) % 2 == 1:
            print('No')
            exit()
    print('Yes')

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def solve():
    w = list(input().rstrip())
    s = set(w)
    for i in s:
        if len([x for x in w if x == i]) % 2 == 1:
            print('No')
            exit()
    print('Yes')

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import numpy as np
w = input()
abc = np.zeros(26,dtype=int)
for i in range(len(w)):
    if w[i] == "a":
        abc[0] += 1
    if w[i] == "b":
        abc[1] += 1
    if w[i] == "c":
        abc[2] += 1
    if w[i] == "d":
        abc[3] += 1
    if w[i] == "e":
        abc[4] += 1
    if w[i] == "f":
        abc[5] += 1
    if w[i] == "g":
        abc[6] += 1
    if w[i] == "h":
        abc[7] += 1
    if w[i] == "i":
        abc[8] += 1
    if w[i] == "j":
        abc[9] += 1
    if w[i] == "k":
        abc[10] += 1
    if w[i] == "l":
        abc[11] += 1
    if w[i] == "m":
        abc[12] += 1
    if w[i] == "n":
        abc[13] += 1
    if w[i] == "o":
        abc[14] += 1
    if w[i] == "p":
        abc[15] += 1
    if w[i] == "q":
        abc[16] += 1
    if w[i] == "r":
        abc[17] += 1
    if w[i] == "s":
        abc[18] += 1
    if w[i] == "t":
        abc[19] += 1
    if w[i] == "u":
        abc[20] += 1
    if w[i] == "v":
        abc[21] += 1
    if w[i] == "w":
        abc[22] += 1
    if w[i] == "x":
        abc[23] += 1
    if w[i] == "y":
        abc[24] += 1
    if w[i] == "z":
        abc[25] += 1
ans = 0
for i in range(26):
    if abc[i]%2 != 0:
        ans = 1
if ans == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = str(input())
dic = {}
for s in w:
    dic.setdefault(s,0)
    dic[s] += 1
#print(dic)
isOK = True
for i in dic.values():
    if i % 2 != 0:
        isOK = False
        break
if isOK:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()

for x in w:
  if w.count(x) % 2 == 0:
    w.replace(x, '')
  else:
    print('No')
    exit()
print('Yes')

Submission status: Accepted

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

c = Counter(w)

for i, v in c.items():
    if v % 2 == 0:
        continue
    else:
        print('No')
        exit()

print('Yes')

Submission status: Accepted

Solution code:
w = input()
chars = []
for c in w:
    chars.append(c)

cset = set(chars)

beautiful = True
for c in cset:
    if chars.count(c) % 2 != 0:
        beautiful = False
        break

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

Submission status: Accepted

Solution code:
N = input()
ans_num = 0
# 重複を消して抽出する
set_N = list(set(N))
for i in set_N:
    if N.count(i) % 2 == 1:
        ans_num = 1
        break
    else:
        continue
if ans_num == 0:
    print('Yes')
else :
    print('No')

Submission status: Accepted

Solution code:
w=list(input())
x=[]
for i in w:
  if w.count(i)%2==0:
    x.append(0)
  else:
    x.append(1)
if x.count(1)==0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import collections
cc = collections.Counter()
for l in raw_input():
	cc[l] +=1
	cc[l] %= 2
print 'Yes' if all([cc[k]%2==0 for k in cc]) else 'No'

Submission status: Accepted

Solution code:
w = list(input())
W = set(w)

for i in W:
    ans = w.count(i)
    if ans % 2 == 1:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
w = input()
w_dict = {}
for char in w:
    if char in w_dict:
        w_dict[char] += 1
    else:
        w_dict[char] = 1

if all(elem%2 == 0 for elem in w_dict.values()):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w=list(input())
W=list(set(w))
a=[]
for i in range(len(W)):
    a.append(w.count(W[i]))
b=[]
for i in range(len(a)):
    if a[i]%2==0:
        b.append('yes')
    else:
        b.append('no')
if 'no' in b:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
str_line = input()
str_line = list(str_line)
str_line.sort()
#print(str_line)
temp = 0
stnum_list = []

for i in range(1,len(str_line)-1):
    if str_line[i] == str_line[i-1]:
        temp += 1
        
    else:
        stnum_list.append(temp)
        temp = 0
        

rsult = 1
#print(len(str_line))

if len(str_line) == 1:
    rsult = 0
else:
    for i in range(len(stnum_list)):
        rsult *= stnum_list[i]

if rsult%2 == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

cnt = Counter(w)
for i in cnt.values():
  if i%2 == 1:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
from collections import Counter
W = input()
x = Counter(W)
for x1 in x.values():
	if x1 % 2 == 1:
		print('No')
		exit()
		
print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w=input()
dic={}
for i in range(len(w)):
    x=w[i]
    if x in dic:
        dic[x]+=1
    else:
        dic[x]=1

ans="Yes"
for key in dic.values():
    if key%2==1:
        ans="No"
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
w = input()

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

Submission status: Accepted

Solution code:
from sys import exit

w = input()

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

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

print('Yes')

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

ss = list(input()[:-1])

ss.sort()

aaa = s(ss)

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
W=str(input())
cnt=[0 for i in range(26)]
ans="Yes"
for i in range(len(W)):
    for j in range(26):
        if ord(W[i])==97+j:
            cnt[j]+=1

for s in range(26):
    if cnt[s]%2!=0:
        ans="No"
print(ans)

Submission status: Accepted

Solution code:
w = list(input())

from collections import Counter

dic = Counter(w)

for i in dic.values():
    if i % 2 == 1:
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
W = Counter(list(input()))
Flag = True
for TW in W:
    if W[TW]%2!=0:
        Flag = False
        break
print(['No','Yes'][Flag])

Submission status: Accepted

Solution code:
def resolve():
    '''
    code here
    '''
    import collections
    w = input()
    cnt = collections.Counter(w)

    for i, v in cnt.items():
        if v %2 != 0:
            print('No')
            break
    else:
        print('Yes')

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w =str(input())

length = len(w)
z = sorted(w)
i=1
m=0
   
if length%2 == 1:
    m = 1
    pass
else:
    while i < length:        
        if z[i]==z[i-1]:
            i += 2
        else:
            m = 1
            break
        
if m == 1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

print('Yes')

Submission status: Accepted

Solution code:
w = list(input())
alp = [chr(i) for i in range(ord('a'), ord('z')+1)]

beautiful = True
for i in alp:
    if w.count(i)%2 != 0:
        beautiful = False
        break
        
if beautiful:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = str(input())
Flag = False

for i in S:
    if not S.count(i) % 2 == 0:
        Flag = True

if Flag:
    print('No')

else:
    print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
cnt=Counter(input())
print('No' if any([x&1 for x in cnt.values()]) else 'Yes')

Submission status: Accepted

Solution code:
a = input()
b = []
c = int(len(a))
import collections

for i in range(c):
  b.append(a[i])

d = collections.Counter(b)
e = []

for i in d.values():
  e.append(i)

f = int(len(e))
g = int(0)

for i in range(f):
  if int(e[i]) % 2 == 0:
    pass
  else:
    g = g + 1

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

Submission status: Accepted

Solution code:
import collections
S=list(input())
c = collections.Counter(S)
L=c.values()
for i in L:
  if i%2==1:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
from collections import *
s=input()
c=Counter(s)
f=0
for i in list(c.values()):
    if(i%2==1):
        f=1
        break
if(f==0):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
w = input()

group = set(w)

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

ans = 0

for j in count:
    if j % 2 == 1:
        ans = 1
    else:
        pass

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

Submission status: Accepted

Solution code:

def resolve():
    import sys
    input = sys.stdin.readline
    # row = [int(x) for x in input().rstrip().split(" ")]
    # n = int(input().rstrip())
    w = input().rstrip()

    import string

    result = {alp: True for alp in string.ascii_lowercase}

    for c in w:
        result[c] = not result[c]

    if all(result.values()):
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

s = list(input())

l = list(Counter(s).values())
for i in range(len(l)):
    if l[i] % 2 == 1:
        print('No')
        exit()
print('Yes')