#include <bits/stdc++.h>
using namespace std;
int main() {
  long n, a, b;
  vector<pair<long, long> > v;
  cin >> n;
  for (int i = 0; i < (int)(n); ++i) {
    cin >> a >> b;
    v.push_back(make_pair(a, b));
  }
  sort(v.begin(), v.end());
  long i = 0;
  bool find = false;
  while (i < n - 1 && !find) {
    if (v[i].second > v[i + 1].second)
      find = true;
    else
      i++;
  }
  if (find)
    cout << "Happy Alex";
  else
    cout << "Poor Alex";
  cout << endl;
  return 0;
}
