Limits 1s, 256 MB

Every competitive programmer’s  dream is to participate in the ICPC World Finals, and so is Eren’s. In order to fulfill his preparation he was going through the previous ICPC problem set and found three problems among which the 1st1^{st} one requires “Binary Search”, 2nd2^{nd} one requires “DP” (Dynamic Programming) and the third one requires “Graph Theory”. These are among some of the topics that every competitive programmer masters. However, he has time to solve only one problem, because he has to participate in a Mathforces round later, which is a website that hosts weekly contests on Math. To pick which one to solve he decided to call his friend Armin and pick a non-negative integer NN, based on which he will determine which problem he will attempt.

He decided to divide the number that Armin picked by 33. If the remainder of the division is 00 then he will solve the problem that requires “DP”, if it is 11 then he will solve the one that requires “Binary Search” and if it is 22 then he will solve the “Graph Theory” one.

Now you have the number NN that Armin picked. Can you tell which problem Eren solved before he participated in the Mathforces round?

Input

The only line of input contains a positive integer NN the number Armin picked.

0N10180 \leq N \leq 10^{18}

Output

Print out the problem that Eren solved.

Samples

InputOutput
3
DP
InputOutput
8
Graph Theory

Don’t forget to print newline ‘\n’ at the end.

Submit

Login to submit.

Statistics

78% Solution Ratio
Avik_AB17Earliest, 5M ago
faisalk5470Fastest, 0.0s
Tahmidul.4404Lightest, 5.1 MB
Marzuq01Shortest, 116B
Toph uses cookies. By continuing you agree to our Cookie Policy.