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