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