# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

# Buy Two, Get One Free

By Yankee16 · Limits 1s, 512 MB

During the Covid-19 pandemic, the members of the Demon Slayer Corps are relaxing at their own houses or at headquarters. Since the Demons are also in quarantine (they’re immune to damage, but not to the Coronavirus 😆), the Demon Slayer Corps don’t have any job.

Tanjiro, Nezuko, Zenitsu, and Inosuke are quarantining with Shinobu at her house. Today, Tanjiro remembers that he once promised Nezuko that he’ll buy her a new Kimono (a traditional Japanese dress). So, he’s now at the nearest shopping mall along with Zenitsu and Inosuke to buy a kimono. After roaming for a while from one shop to another, the three finally chose three beautiful Kimonos. They liked each of them very much and wished to buy them. But, they found out that with all the money they have, they can only buy two Kimonos.

Luckily, the shop has a special buy two and get one free offer. To get that offer, the sum of the price of any two Kimonos must be odd. The three Demon Slayers are very good at fighting demons, but terrible at math. So they ask their smart friend, you, to tell them whether they can get the offer or not.

## Input

The only line of input will contain three integers $A$, $B$, and $C$ indicating the price of the three Kimonos.

$1 \leq A, B, C \leq 10^9$

## Output

You have to output a single line, “3 Kimonos for Nezuko” (without quotes) if they can buy all three Kimonos, or “You have to choose two” (without quotes) otherwise.

## Samples

InputOutput
2 3 5

3 Kimonos for Nezuko

InputOutput
2 4 6

You have to choose two


### Statistics

95% Solution Ratio

MursaleenEarliest, 1w ago

Sarwat.33Fastest, 0.0s

Sarwat.33Lightest, 0 B

One_AutumnLeafShortest, 141B