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: Runtime Error

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

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

print(ans

Submission status: Runtime Error

Solution code:
w = input()

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

Solution code:
w = list(input())
w.sort()
i = 0
while i < len(w):
	if w[i] != w[i+1]:
		print('No')
		exit()
	i += 2
else:
	print('Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
from collections import Counter

s = input()

c = Counter(s)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
w = input()

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

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

Submission status: Runtime Error

Solution code:
w = input()

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

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

Submission status: Runtime Error

Solution code:
q

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
w = input()
index, count = np.unique(list(w), return_counts=True)
if all(count % 2 == 0):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# Most useful math functions
from math import gcd

# For sys.std*, sys.argv etc...
import sys

# For cases when input tokens are spread unevenly over many lines.
# This provides methods for reading tokens of various types.
class BufferedTokenizer:
    pass

def read_ints():
    return [int(token) for token in input().split()]

def read_tokens():
    return input().split()

def main():
    s = input()
    counts = dict()
    for c in s:
        counts[c] = counts.get(c, 0) + 1

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

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
# Useful data structures
from collections import Counter

# Most useful math functions
from math import gcd

# For sys.std*, sys.argv etc...
import sys

# For cases when input tokens are spread unevenly over many lines.
# This provides methods for reading tokens of various types.
class BufferedTokenizer:
    pass

def read_ints():
    return [int(token) for token in input().split()]

def read_tokens():
    return input().split()

def main():
    counts = Counter(input())
    print("Yes" if all(v % 2 == 0 for v in counts.values()) else "No")

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
# Useful data structures
from collections import Counter, defaultdict, deque, namedtuple

# Most useful math functions
from math import gcd

# For sys.std*, sys.argv etc...
import sys

# For cases when input tokens are spread unevenly over many lines.
# This provides methods for reading tokens of various types.
class BufferedTokenizer:
    pass

def read_ints():
    return [int(token) for token in input().split()]

def read_tokens():
    return input().split()

def main():
    counts = Counter(input())
    print("Yes" if all(v % 2 == 0 for v in counts.values()) else "No")

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
import sys
S = input()
alp = list(set(S))
cnts = [0] * len(alp)
for i in range(len(S)):
    cnts(alp.index(S[i])) += 1
    
for a in cnts:
    if a%2 == 1:
        print("No")
        sys.exit()
print("Yes")

Submission status: Runtime Error

Solution code:
# solution

data = input()
for i in data:
    if data.count(i) % 2:
        print('No')
    	exit()
print('Yes')

Submission status: Runtime Error

Solution code:
from collections import Counter
s=input()
d=Conter(s)
da=[i for i in d if d[i]%2==0]
if len(da)==len(set(s)):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import collections

s = input()

c = collections.Counter(s)

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

Submission status: Runtime Error

Solution code:
import collections 

w=input()

l=collections.Counter(list(w))
l=list(l.values())
flg=0
for i in range(len(l)):
    if l[i]%2!=0:
        flg+=1

if flg==0:
    print('Yes')
else:
    pritn('No')

Submission status: Runtime Error

Solution code:
words = input()
ans = 'No'

for word in words:
  if words.count(word) %2 != 0:
    breake
  else:
    ans ='Yes'
    
print(ans)

Submission status: Runtime Error

Solution code:
words = input()
ans = 'No’

for word in words:
  if words.count(word) %2 != 0:
    breake
  else:
    ans = ('Yes’)
    
print(ans)

Submission status: Runtime Error

Solution code:
words = input()
ans = 'No’

for word in words:
  if words.count(word) %2 != 0:
    breake
  else:
    ans = ('Ye’s)
    
print(ans)

Submission status: Runtime Error

Solution code:
words = input()
ans = 'NO'

for word in words:
  if words.count(word) %2 != 0:
    breake
  else:
    ans = ('YES')
    
print(ans)

Submission status: Runtime Error

Solution code:
li = list(input())
li.sort()
while True:
    if len(li) == 0:
        print("Yes")
        break
    elif li[0] == li[1]:
        li.pop(0)
        li.pop(0)
    else:
        print("No")
        break

Submission status: Runtime Error

Solution code:
li=list(input())
li.sort()
while True:   
    if len(li)==0:
        print("Yes")
        break
    elif li[0]==li[1]:
        li.pop(0)
        li.pop(0)
    else:
        print("No")
        break

Submission status: Runtime Error

Solution code:
w=sorted(list(input()));s="Yes" 
for i in range(0,len(w),2):
    if w[i]!=w[i+1]:s="No"
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
w = input()
alp = 'abcdefghijklmnopqrstuvwxyz'
c = []
for i in range(26):
    a = w.count(alp[i])
    c.append(a)
d = 0
for i in range(len(w)):
    if int(c[i]) % 2 == 0:
        d = 1
    else:
        break
if d == 0:
    print('No')
else:
    print('Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
st = set(S)
for i in range(len(st)):
  if S.count(st[i]) % 2 != 0:
    print("No")
    exit()
print("Yes")

Submission status: Runtime Error

Solution code:
li = [0]*26
alpha2num = lambda c: ord(c) - ord("A")
w = input().upper()
for i in range(len(w)):
  k = alpha2num(w[i])
  li[k] += 1
else:
  for j in li:
    if(not j %= 2):
      print("No")
      break
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
li = [0]*26
alpha2num = lambda c: ord(c) - ord("A") + 1
w = input().upper()
for i in range(len(w)):
  k = alpha2num(w[i])
  li[k] += 1
else:
  for j in li:
    if(not j %= 2):
      print("No")
      break
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
li = [0]*26
alpha2num = lambda c: chr(c+64)
w = input()
for i in range(len(w)):
  k = alpha2num(w[i])
  li[k] += 1
else:
  for j in li:
    if(not j %= 2):
      print("No")
      break
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
li = []*26
alpha2num = lambda c: chr(c+26)
w = input()
for i in range(len(w)):
  k = alpha2num(w[i])
  li[k] += 1
else:
  for j in li:
    if(not j %= 2):
      print("No")
      break
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
w = input()
a = "abcdefghijklmnopqrstuvwxyz"
co = 0
ch = True
for i in a:
    for j in w:
        if i == j:
            co += 1:
    if co % 2:
        ch = False
        break
    co = 0
    
    
if ch:
    print("yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
w = input()
a = "abcdefghijklmnopqrstuvwxyz"
co = 0
ch = True
for i in a:
    for j in w:
        if i = j:
            co += 1:
    if co % 2:
        ch = False
        break
    co = 0
    
    
if ch:
    print("yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
w = input()
a = abcdefghijklmnopqrstuvwxyz
co = 0
ch = True
for i in a:
    for j in w:
        if i = j:
            co += 1:
    if co % 2:
        ch = False
        break
if ch:
    print("yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
from collections import Counter
w = list(Counter(list(input())).items())
if all(w[i][1]%2== for i in range(len(w))):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a = str(input())

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;

int main(){
	string s;
	cin >> s;
	int N=s.size();
	sort(s.begin(),s.end());
	int cnt=1;
	for(int i=0;i<N-1;i++){
		if(s.at(i)==s.at(i+1)){
			cnt++;
		}
		else if(cnt%2!=0){
			break;
		}
		else{
			cnt=1;
		}
	}
	if(cnt%2){
		cout << "No" << endl;
	}
	else{
		cout << "Yes" << endl;
	}
}

Submission status: Runtime Error

Solution code:
s = input()
from collections import Counter
c = Counter(s)

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

Submission status: Runtime Error

Solution code:
s = input()
from collections import Counter
c = Counters(s)

bl = True;
for v in c.values():
  if v%2==1:
    bl = False

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import Counter

s=input()
s=Couter(s)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import defaultdict
s=list(input())
d=defaultdict(0)
for i in s:
  d[i]+=1
for i in d.values():
  if i%2:
    print("No")
    break
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
from collections import Counter
c1 = Counter(input())
for c num in c1:
  if c1[c] % 2 != 0:
    print('No')
    break
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
w=input().strip()
from collections import Counter
s~Counter(w)
for a in s.values():
    if a%2==1:
        print("No")
        exit()
print("Yes")

Submission status: Runtime Error

Solution code:
 import collections

s = input()
lst = []
for i in s:
    lst.append(i)
c = collections.Counter(lst)
if sum(c.values()) % 2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = input()
s_list = [s[_] for _ in range(len(s))]

dic = dict()
for c in s_list:
  if c in dic:
    dic[c] += 1
  else:
    dic[c] = 1

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding: utf-8
import sys


def main(argv=sys.argv):

    char_list = input()

    char_set = set(char_list)

    for char in char_set:

        if char_list.count(char) % 2 != 0:

            print('No')

            return -1

    print('Yes')

    return 0


if __name__ == '__main__':
    sys.exit(main())

Submission status: Runtime Error

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

c = Counter(l)

flag = True

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

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

Submission status: Runtime Error

Solution code:
w = input()
print(set(w))
"""for i in set(w):
  print(w)
  if w.count(i)%2 != 0:
    print("No")
    exit()
print("Yes")"""
セットで出てくる文字列を絞って数える

Submission status: Runtime Error

Solution code:
S = input()
A = set([i for i in S])
for j in range(len(A)):
  if S.count(A[j]) % 2 == 1:
    print("Yes")
    sys.exit()
  else:
    None
print("No")

Submission status: Runtime Error

Solution code:
w = input()

f = True
for i in renge(len(w)):
  if w.count(w[i]) % 2 == 1:
    print("No")
    f = False
if f:
  print("Yes")

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline

count = [0] * 26
w = input()
for ch in w:
    count[ord(ch) - ord("a")] += 1
ok = True
for item in count:
    if item % 2 == 1:
        ok = False
print("Yes" if ok else "No")

Submission status: Runtime Error

Solution code:
# ABC044 B - 美しい文字列 / Beautiful Strings
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

S = si()
SS = set()
for s in S:
    SS.add(s)

for ss in SS:
    if S.count(SS)%2==1:
        print('No')
        exit()
print('Yes')

Submission status: Runtime Error

Solution code:
w = input()

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

print(ans)

Submission status: Runtime Error

Solution code:
w = input()

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

print(ans)

Submission status: Runtime Error

Solution code:
w = input()

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

print(ans)

Submission status: Runtime Error

Solution code:
w = input()

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

Submission status: Runtime Error

Solution code:
w = input()

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

Submission status: Runtime Error

Solution code:
w = input()

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

Submission status: Runtime Error

Solution code:
w=list(input())
ans=sorted(w)

while ans[-1]==ans[-2] and len(ans)>1:
  del ans[-2:]
  if len(ans)==0 or len(ans)==1:
    break

if len(ans)==0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
w=list(input())
ans=sorted(w)

while ans[-1]==ans[-2]:
  del ans[-2:]
  if len(ans)==0 or len(ans)==1:
    break

if len(ans)==0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
w=list(input())
ans=sorted(w)

while ans[-1]==ans[-2]:
  del ans[-2:]
  if len(ans)==0 or len(ans)==1:
    break

if ans==[]:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
w=list(input())
ans=sorted(w)

print(ans)
while ans[-1]==ans[-2]:
  del ans[-2:]
  if ans==[] or len(ans)==1:
    break

if ans==[]:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
w=list(input())
ans=sorted(w)

print(ans)
while ans[-1]==ans[-2]:
  del ans[-2:]
  if ans==[] or len(ans)==1:
    break
  print(ans)

if ans==[]:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
w=list(input())
ans=sorted(w)

print(ans)
while ans[-1]==ans[-2]:
  del ans[-2:]
  if ans==[]:
    break
  print(ans)

if ans==[]:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
w=input()
if len(w)%2==1:
   print('No')
else:
   c=0
   import string
   for _ in string.ascii_lowercase:
      if not w.count(_)%2==0:
         c+=1
if c==0:
   print('Yes')
else:
   print('No')

Submission status: Runtime Error

Solution code:
w = input()
from collection import defaultdict
D = defaultdict(int)

for i in w:
    D[i]+=1
flag = 0
for i in D:
    if D[i]%2==1:
        flag = 1
        break
if flag==1:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
w=input()
s=''
while True:
	s=w[0]
	if w.count(s)%2==1:
		print('No')
		break
	w=w.replace(s,'')
	if w:
		print('Yes')
		break

Submission status: Runtime Error

Solution code:
w=input()
s=''
while True:
	s=w[0]
	if w.count(s)%2==1:
		print('No')
		break
	print(w)
	w=w.replace(s,'')
	print(w)
	if w:
		print('Yes')
		break

Submission status: Runtime Error

Solution code:
w=str(input())
s=''
while True:
	s=w[0]
	if w.count(s)%2==1:
		print('No')
		break
	w.replane(s,'')
	if w:
		print('Yes')
		break

Submission status: Runtime Error

Solution code:
w=input()

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

Submission status: Runtime Error

Solution code:
a = defaultdict(int)
for w in input():
  a[w] += 1
print('Yes' if sum(c % 2 for c in a.values()) == 0 else 'No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

while True:
    w = input()

    if not w.islower():
        continue

    if len(w) >= 100:
        continue

    for n_alpha in "abcdefghijklmnopqrstuvwxyz":
        count_alpha = w.count(n_alpha)
        if count_alpha % 2 == 1:
            print('No')
        else:
            print('Yes')
        break
    break

sys.exit()

Submission status: Runtime Error

Solution code:
import sys

def input_w():
    w = input()

    while w.islower():

        length = len(w)
        if length >= 100:
            return input_w()

        for n_alpha in "abcdefghijklmnopqrstuvwxyz":
            count_alpha = w.count(n_alpha)
            if count_alpha % 2 == 1:
                print('No')
                return input_w()

        print('Yes')
        sys.exit()

    return input_w()

w=input_w()

Submission status: Runtime Error

Solution code:
a=list(input())
sum=0
b=set(a)
for i in range(len(b)):
  if a.count(b[i])%2==0:
    sum+=1
print("Yes" if sum==len(b) else "No")

Submission status: Runtime Error

Solution code:
from collectiosn import Counter

c = Counter(input())
valid = True
for key, value in c.items():
    if value % 2 == 1:
        valid = False
        break
if valid:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import Counter as ca

s = input()

count = ca(s)
count = list(ca.values())
ans = 'Yes'
for i in count:
  if i % 2 != 0:
    ans = 'No'
    break
    
print(ans)

Submission status: Runtime Error

Solution code:
w=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]
flag=0
for i in alphabet:
	num=w.count(i)
	if num%2==1:
		flag=1
		break
if flag==0:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

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

print("Yes")

Submission status: Runtime Error

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

print("Yes")

Submission status: Runtime Error

Solution code:
from collections import Counter
r = 0
cnt = Counter(input()):
for c in cnt:
    r += cnt[c] % 2
if r == 0:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
word = input()

flag = True
if len(word)%2 == 1:
    flag = False

wordset = set(word)
leng = len(wordset)
for s in wordset:
    if word.count(s)％2 == 1:
        flag = False
        break
if flag:print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
word = input()

flag = True
if len(word)%2 == 1:
    flag = False

wordset = set(word)
leng = len(wordset)
i = 0
while flag and (i<leng):
    if (word.count(wordset[i]))%2 == 1:
        flag = False
    i += 1
if flag:print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
word = input()

flag = True
if len(word)%2 == 1:
    flag = False

wordset = set(word)
leng = len(wordset)
i = 0
while flag and (i<leng):
    if word.count(wordset[i])%2 == 1:
        flag = False
        break
    i += 1
if flag:print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
word = input()

flag = True
if len(word)%2 == 1:
    flag = False
tab = ["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
leng = len(word)
while flag and (i<leng):
    if word.count(tab[i])%2 == 1:
        flag = False
        break
    i += 1
if flag:print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
import sys
word = input()

if len(word)%2 == 1:
    print("No")
    sys.exit()
tab = ["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"]
flag = True
for i in range(len(word)):
    if word.count(tab[i])%2 == 1:
        flag = False
        break
if flag:print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
import sys
word = input()

tab = ["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"]
flag = True
if len(word)%2 == 1:
    print("No")
    sys.exit()
for i in range(len(word))
    if word.count(tab[i])%2 == 1:
        flag = False
        break
if flag:print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
main():
  ans = func(input())
  print(ans)
  
  
def func(sentence):
  unique_list = set(sentence)
  for s in unique_list:
    if sentence.count(s) % 2 != 0:
      return('No')
      break
  return('Yes')

if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    k = II()
    x = II()
    y = II()
    ans = 0
    for i in range(n):
        if i >= k:
            ans += y
        else:
            ans += x
    print(ans)
    return

#B
def B():
    w = S()
    d = defaultdict(int)
    for s in w:
        d[s] += 1
    for di in d.values():
        if di % 2:
            continue
        print("No")
        break
    print("Yes")
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    k = II()
    x = II()
    y = II()
    ans = 0
    for i in range(n):
        if i >= k:
            ans += y
        else:
            ans += x
    print(ans)
    return

#B
def B():
    w = S()
    d = defaultdict(int)
    for s in w:
        d[s] += 1
    for di in d.values():
        if d % 2:
            continue
        print("No")
        break
    print("Yes")
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Runtime Error

Solution code:
w=input()
arr=[]
for i in set(s):
    arr.append(s.count(i)%2==0)
print(all(arr))

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
# coding=utf-8
w=input()
arr=[]
for i in set(s):
    arr.append(s.count(i)%2==0)
print(all(arr))

Submission status: Runtime Error

Solution code:
from collections import Counter
l = list(input())
x = Counter(l)
for i in x:
    if i%2==1:
        print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
import sys
s = input()
ans = {}
for i in s:
  if i in ans:
    ans[i] +=1
  else:
    ans[i] = 0
for i in ans:
  if i%2 !=0:
    print('No')
    sys.exit()
print('Yes')

Submission status: Runtime Error

Solution code:
import sys
s = input()
ans = ['a':0,'b':0,'c':0]
for i in s:
	if i in ans:
		ans[i] +=1
    else:
		print('NO')
        sys.exit()
print('YES' if (ans['a']%2==0 and ans['a']%2==0 and ans['a']%2==0) else 'NO')

Submission status: Runtime Error

Solution code:
from collections import Counter
a = input()
b = Counter(a)
c = 0

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