// Program 10: Happy Number Using Recursion

import java.util.*;
class HappyRecursive {
    static int digitSquares(int n) {
        if (n == 0) {
            return 0;
        }
        int digit = n % 10;
        return digit * digit + digitSquares(n / 10);
    }
    static boolean happy(int n) {
        if (n == 1) {
            return true;
        }
        if (n == 4) {
            return false;
        }
        return happy(digitSquares(n));
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        if (n < 1) {
            System.out.println("Invalid number");
            return;
        }
        System.out.println(happy(n) ? "Happy" : "Not Happy");
    }
}