{"problem":{"name":"Beautiful Strings","description":{"content":"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 time","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc044_b"},"statements":[{"statement_type":"Markdown","content":"Let $w$ be a string consisting of lowercase letters. We will call $w$ _beautiful_ if the following condition is satisfied:\n\n*   Each lowercase letter of the English alphabet occurs even number of times in $w$.\n\nYou are given the string $w$. Determine if $w$ is beautiful.\n\n## Constraints\n\n*   $1 \\leq |w| \\leq 100$\n*   $w$ consists of lowercase letters (`a`\\-`z`).\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$w$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc044_b","tags":[],"sample_group":[["abaccaba","Yes\n\n`a` occurs four times, `b` occurs twice, `c` occurs twice and the other letters occur zero times."],["hthth","No"]],"created_at":"2026-03-03 11:01:13"}}