CodeForces 456A

Laptops

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 456A

Description

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.

Input

The first line contains an integer n (1 ≤ n ≤ 10⁵) — 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).

Sample Input

Input

2
1 2
2 1

Output

Happy Alex

//2016.8.2
#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

struct laptop
{
    int a, b;
}lap[100005];

bool cmp(laptop x, laptop y)
{
    if(x.a == y.a)return x.b < y.b;
    return x.a < y.a;
}

int main()
{
    int n;
    bool fg;
    while(scanf("%d", &n)!=EOF)
    {
        fg = false;
        for(int i = 0; i < n; i++)
        {
            scanf("%d %d", &lap[i].a, &lap[i].b);
        }
        sort(lap, lap+n, cmp);

        for(int i = 1; i < n; i++)
            if(lap[i].b < lap[i-1].b)
            {
                fg = true;
                break;
            }
        if(fg)cout << "Happy Alex
";
        else cout << "Poor Alex
";
    }

    return 0;
}