Ascending and Descending

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

Read pairs $(X,Y)$. Print exactly Crescente when $X<Y$ and Decrescente when $X>Y$. Stop at the first equal pair without printing a line for it.

Input

One pair per line; the last pair has equal values. The PHOJ edition has at most 100 preceding unequal pairs and values in $[-10^6,10^6]$.

Output

One exact case-sensitive keyword per pair before the stopping pair.

Subtasks

• Subtask 1 (20%): At most 3 unequal pairs preceding the equal pair.

• Subtask 2 (30%): At most 20 unequal pairs preceding the equal pair.

• Subtask 3 (50%): At most 100 unequal pairs preceding the equal pair.

Examples

Example 1

Input:

2 5
8 3
4 4

Output:

Crescente
Decrescente

Explanation:

Each unequal pair yields one exact keyword; the equal pair stops processing without output.

Example 2

Input:

7 7

Output:

Explanation:

Each unequal pair yields one exact keyword; the equal pair stops processing without output.