Beautiful Strings

AtCoder

IDabc044_b

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

abaccaba

Output #1

Yes

`a` occurs four times, `b` occurs twice, `c` occurs twice and the other letters occur zero times.

Input #2

hthth

Output #2

No

API Response (JSON)

{
  "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 time...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments