ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules

УрКОП 2020

About     Problems     Submit solution     Judge status     Standings
Contest is over

E. Among Us

Time limit: 1.0 second
Memory limit: 256 MB
Rumor has it that sabotages on spaceships started happening more often. In order to solve this problem, the transporting company developed a scanning device that detects impostors among crew members.
The device collects information about all people on the spaceship and keeps it in a convenient manner. The information is stored in a single string S that consists of words “Crewmate” and “Impostor” not separated by spaces. The only thing left is to implement a module that would analyze this string and tell everybody how many impostors are there on the spaceship. And the crew is to decide what happens next.

Input

The first line contains the string S (8 ≤ |S| ≤ 96, where |S| is the string’s length).

Output

If there are impostors on the ship, output a single line “There is x Impostor among us”, where x is the number of impostors. Otherwise output a single line “Clear”.

Samples

inputoutput
ImpostorCrewmateCrewmate
There is 1 Impostor among us
CrewmateCrewmate
Clear
ImpostorImpostor
There is 2 Impostor among us
Problem Author: Semyon Trifochkin, prepared by Daniil Zheludkov
Problem Source: Ural School Programming Contest 2020