Problem C
Grotesquely Clean
If you look around the buildings of the University of Chicago, you will find many carved stone figures called grotesques (fun fact: these are commonly known as “gargoyles”, but a gargoyle is actually a type of grotesque and, specifically, one that spouts water). The grotesques have to be cleaned periodically, for which the university employs a Grotesque Cleaner called Hans Wasserspeier. Hans has recently taken on a young and enterprising apprentice, Graham R. Goyle, who suggested the Department of Computer Science could write a program that can help Hans and Graham determine whether a grotesque has to be cleaned or not.
The process to determine whether a grotesque has to be cleaned is very simple. First, Hans and Graham measure how dirty the grotesque is on ten different spots (each of these ten measurements will, ordinarily, have a value between 1 and 5). Then, if these ten measurements add up to a total of 30 or more, then the grotesque needs to be cleaned. Otherwise, it does not have to be cleaned.
However, sometimes, an specially dirty spot will result in a measurement having a value of 6. When this happens, the grotesque has to be cleaned, even if the measurements don’t add up to 30.
Input
The input is composed of a single line, with ten integers, each separated by a single space. Each integer represents a measurement $m$ ($1 \leqslant m \leqslant 6$).
Output
If the grotesque has to be cleaned, print CLEAN. If the grotesque does not have to be cleaned, print DO NOT CLEAN.
| Sample Input 1 | Sample Output 1 |
|---|---|
1 1 1 1 2 1 3 1 1 2 |
DO NOT CLEAN |
| Sample Input 2 | Sample Output 2 |
|---|---|
1 1 1 1 2 6 3 1 1 2 |
CLEAN |
| Sample Input 3 | Sample Output 3 |
|---|---|
5 5 4 5 3 5 2 5 4 3 |
CLEAN |
