Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

Unknown Language Round #2:

- Io-2008-01-07 (Win32)

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

I. Goofy Numbers

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe non-negative integer *a* is a divisor of the non-negative integer *b* if and only if there exists a positive integer *c* such that *a* × *c* = *b*.

Some numbers are really interesting. Commander Surena defines some interesting properties for non-negative integers:

- An integer is happy if it is divisible by at least one of its digits and not by all of them.
- An integer is happier if it is divisible by all of its digits.
- An integer is upset if it's divisible by none of its digits.

Surena asks you to find out if a given number is happy, happier or upset.

Input

Input contains a single non-negative integer *n* (1 ≤ *n* ≤ 10^{8}).

Output

Write on a single line the type of the integer: happy, happier or upset. Print the type in lowercase letters.

Examples

Input

99

Output

happier

Input

29994

Output

happy

Input

23

Output

upset

Note

In the second test 29994 is only divisible by 2.

In the third test 23 is a prime number.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/20/2017 20:43:29 (c3).

Desktop version, switch to mobile version.

User lists

Name |
---|