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