456A - Laptops - CodeForces Solution

import os
import sys
import math
from collections import deque, defaultdict
import bisect
import heapq

input = sys.stdin.readline


def multiple():
    a = map(int, input().split())
    return a


def array():
    a = input().split()
    return a


def intarray():
    a = list(map(int, input().split()))
    return a


def intinput():
    n = int(input())
    return n


def strinput():
    s = input().strip()
    return s


def isPrime(n):
    val = int(math.sqrt(n)) + 1
    for i in range(2, val):
        if n % i == 0:
            return False
    return True


def solution():
        MOD = 1000000007
    n = intinput()
    arr=[]
    for i in range(n):
        a,b = multiple()
        arr.append([a,b])
    arr.sort()
    maxsofar = 0
    for i in range(n):
        a,b = arr[i]
        if b <= maxsofar:
            print("Happy Alex")
            return
        maxsofar = b
    print("Poor Alex")
    return


t = 1
for _ in range(t):
        solution()