#include <bits/stdc++.h>
using namespace std;
int n;
int a[100001], b[100001], p[100001];
bool cmp(const int &x, const int &y) { return a[x] < a[y]; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
  for (int i = 1; i <= n; i++) p[i] = i;
  sort(p + 1, p + 1 + n, cmp);
  int min = n + 1;
  for (int i = n; i; i--) {
    if (b[p[i]] < min) min = b[p[i]];
    if (b[p[i]] > min) {
      printf("Happy Alex\n");
      return 0;
    }
  }
  printf("Poor Alex\n");
}
