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