A. Sad Santa
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Santa is sad today, and to cure his sadness, he has decided to gamble his troubles away in a game of dice. The casino attendant rolls a huge 1000-sided dice which has numbers from $$$1$$$ to $$$1000$$$; if the number that comes up on top has only odd digits, the player wins, otherwise, the house wins. Santa is naturally happier when winning at games of chance, and he becomes happy if and only if the number $$$n$$$ that is rolled is a winning number for him. Given $$$n$$$, will Santa be happy?

Input

The first line of input will contain $$$n (1 \le n \le 1000)$$$, the number that Santa rolled.

Output

Output "HAPPY" if Santa will become happy, and "SAD" if Santa stays sad.

Examples
Input
13
Output
HAPPY
Input
21
Output
SAD