Sanalista

# Author: Jussi Marttinen
# Last edited: 2020/09/28
# My solution for Datatähti 2020
 
# counts letters
from collections import Counter
 
# Gets the inputs
n = int(input())
words = []
for _ in range(n):
    words.append(input())
 
# how many words fill the quota
accepted = 0
 
for w in words:
    # individual letter counts in a dict_values object
    letter_counts = dict(Counter(w)).values()
    # list containing parity of every letter
    # inverted because then all() is easier to use
    inverted_parities = list(map(lambda x: not (x % 2), letter_counts))
    # all(inverted_parities) is 1 if all elements are 1 (so all counts are even) 
    accepted += all(inverted_parities)
 
print(accepted)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED