#include <bits/stdc++.h>
using namespace std;
long int n, l, k, i, m, s;
pair<long int, long int> a[100000];
int main() {
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i].first >> a[i].second;
  sort(a, a + n);
  for (i = 1; i < n; i++)
    if (a[i].second < a[i - 1].second) {
      cout << "Happy Alex";
      return 0;
    }
  cout << "Poor Alex";
}
