Laptops

## 题目描述 有一天Dima和Alex正在讨论关于 $n$ 台笔记本电脑的价格与质量。Dima认为价格高的笔记本质量也高，而Alex认为笔记本是物美价廉，价格低的笔记本质量反而高。 正当他们争（吵）论得不可开交之时，您过来了。现在您需要写出一个程序去确认谁是谁非。 ## 输入输出格式 ### 输入格式 第一行输入笔记本个数 $n$ $(n \leqslant 10^5)$ 。 接下来的 $n$ 行输入两个数,分别是第 $n$ 个笔记本的价值 $a_i$ 与质量 $b_i$。 保证所有的 $a_i$ 与 $b_i$ 不同，且属于 $int$ 范围。 ### 输出格式： 如果存在符合Alex的要求的两台笔记本电脑（即一台的价格比另一台低且质量比另一台高），则输出"Happy Alex"，否则输出"Poor Alex"。 翻译提供者：Black_white_tony

One 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.

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.

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

2
1 2
2 1

Happy Alex