Being a cuteness connoisseur, Carol has devised a system of measuring cuteness called "Carol Numbers", where one Carol number represents her own cuteness in a natural state.

Cactus numbers are said to represent ten times the cuteness as a Carol number. Some say that Cactus numbers do not exist, as a Carol number should be the highest conceivable value of cuteness. You will receive Carol numbers, given in *insignificant* units as there are rarely Carol numbers above . One insignificant Carol is of a Carol. Is the Carol number truly the highest possible cuteness?

#### Constraints

#### Input Specification

The first line will contain , the number of values.

Each of the following lines will contain an integer , representing the Carol number, represented as cuteness in insignificant Carols.

#### Output Specification

If any Carol number above 10 exists, output `Something is wrong with these cuteness values`

.

If any Carol number above 1 exists, but no Carol number above 10 exists, output `Cuteness by definition is similarity to Cactus`

.

If no Carol numbers above 1 exist, output `Cuteness by definition is similarity to Carol`

.

#### Sample Input 1

```
3
500
800
1000
```

#### Sample Output 1

`Cuteness by definition is similarity to Carol`

#### Sample Input 2

```
5
34
7564
345
654
2
```

#### Sample Output 2

`Cuteness by definition is similarity to Cactus`

## Comments

I'm failing cases 2, 9, 13 and 15. Can someone tell me what's wrong?

Your code will fail when the max is 10000

Does anyone know how I can get past a TLE?

Put these two lines at the beginning of your code. The input will be faster.