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