#include <bits/stdc++.h>
using namespace std;
struct rect {
  int x;
  int y;
};
bool cmp(rect r1, rect r2) {
  if (r1.x != r2.x) {
    return r1.x < r2.x;
  } else {
    return r1.y < r2.y;
  }
}
rect r[100001];
int main() {
  int n = 0;
  scanf("%d", &n);
  int i = 0;
  for (i = 0; i < n; i++) {
    scanf("%d%d", &r[i].x, &r[i].y);
  }
  sort(r, r + n, cmp);
  int flag = 1;
  for (i = 1; i < n; i++) {
    if (r[i].y < r[i - 1].y) {
      flag = 0;
    }
  }
  if (flag == 0) {
    printf("Happy Alex\n");
  } else {
    printf("Poor Alex\n");
  }
  return 0;
}
