#include <bits/stdc++.h>
using namespace std;
typedef struct _lap {
  int p;
  int qu;
} lap;
bool cmp(const lap &a, const lap &b) { return a.p < b.p; }
void remain() {
  int n;
  cin >> n;
  vector<lap> laps;
  for (int i = 0; i < n; ++i) {
    lap x;
    cin >> x.p >> x.qu;
    laps.push_back(x);
  }
  sort(laps.begin(), laps.end(), cmp);
  enum RE { HAPPY_ALEX, POOR_ALEX };
  RE re = POOR_ALEX;
  for (int i = 0; i < laps.size() - 1; ++i) {
    if (!(laps[i].qu < laps[i + 1].qu)) {
      re = HAPPY_ALEX;
      break;
    }
  }
  if (re == HAPPY_ALEX)
    cout << "Happy Alex";
  else
    cout << "Poor Alex";
}
int main() {
  remain();
  return 0;
}
