D2

Time limit2.222sMemory limit222 MB

Summary

Given one line of text up to 10,000 characters, print D2 if it contains the adjacent pair D2 or d2, otherwise print unrated.

Level: Easy1 of 10
Topics: String, String matching
Solved: No attempts yet

Problem

The Yonsei University Programming Contest was held again this year!

Byeongcheol had planned to enter the contest and win prize money, but he was suddenly dragged into the problem setting team.

When Byeongcheol joined the team, he learned a shocking fact: if the contest did not receive funding, the problem setters would have to pay the prize money out of their own pockets. Fortunately, the contest received funding, so that disaster was avoided.

Escaping the threat to his wallet, Byeongcheol immediately opened an online judge and solved a problem of difficulty $D2$ . Now he intends to give the contestants a problem of difficulty $D2$ too!

However, his skills are not good enough to write a $D2$ level problem, so he simply named the problem $D2$ .

You too, try solving a problem of $D2$ level (in name only)!

Input

The first line contains a string made of uppercase and lowercase English letters, digits, and spaces. The length of the string is at most $10\ 000$ .

The first and last characters of the string are guaranteed not to be spaces.

Output

If the string contains $D2$ or $d2$ , print D2. The two characters must be adjacent, so a space between $D$ / $d$ and $2$ is not allowed.

If the string does not contain such characters, print unrated.

Examples2

Example 1
Input
```
naver d2
```
Expected output
```
D2
```
Example 2
Input
```
naver d3
```
Expected output
```
unrated
```