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