Codeforces Round #260 (Div. 2) A. Laptops

A. Laptops

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

Input

2
1 2
2 1

Output

Happy Alex

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

#define N 100050

int main()
{
    int n,a,b,flag=1;
    scanf("%d",&n);
    for (int i=1;i<=n;i++){
        scanf("%d%d",&a,&b);
        if ( a != b ) flag=0;
    }
    if (flag) printf("Poor Alex\n");
    else printf("Happy Alex\n");
    return 0;
}