#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
};
node a[100010];
bool cmp(node a, node b) { return a.x < b.x; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%d%d", &a[i].x, &a[i].y);
  sort(a, a + n, cmp);
  int flag = 0;
  for (int i = 1; i < n; i++) {
    if (a[i].y < a[i - 1].y) {
      flag = 1;
      break;
    }
  }
  if (flag == 0)
    cout << "Poor Alex";
  else
    cout << "Happy Alex";
  return 0;
}
