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