#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int> > v;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    v.push_back(pair<int, int>(a, b));
  }
  sort(v.begin(), v.end());
  for (int i = 1; i < n; i++)
    if (v[i - 1].second > v[i].second) {
      printf("Happy Alex\n");
      return 0;
    }
  printf("Poor Alex\n");
  return 0;
}
