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

A. Laptops

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOne day Dima and Alex had an argument about the price and quality of laptops. Dima thinks that the more expensive a laptop is, the better it is. Alex disagrees. Alex thinks that there are two laptops, such that the price of the first laptop is less (strictly smaller) than the price of the second laptop but the quality of the first laptop is higher (strictly greater) than the quality of the second laptop.

Please, check the guess of Alex. You are given descriptions of *n* laptops. Determine whether two described above laptops exist.

Input

The first line contains an integer *n* (1 ≤ *n* ≤ 10^{5}) — the number of laptops.

Next *n* lines contain two integers each, *a*_{i} and *b*_{i} (1 ≤ *a*_{i}, *b*_{i} ≤ *n*), where *a*_{i} is the price of the *i*-th laptop, and *b*_{i} is the number that represents the quality of the *i*-th laptop (the larger the number is, the higher is the quality).

All *a*_{i} are distinct. All *b*_{i} are distinct.

Output

If Alex is correct, print "Happy Alex", otherwise print "Poor Alex" (without the quotes).

Examples

Input

2

1 2

2 1

Output

Happy Alex

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/28/2017 00:18:33 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|