#include <bits/stdc++.h>
using namespace std;
typedef struct Computer {
  int a;
  int b;
} Computer;
bool comp(Computer a, Computer b) { return a.b > b.b; }
vector<Computer> computer(100010);
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d%d", &computer[i].a, &computer[i].b);
  sort(computer.begin(), computer.begin() + n, comp);
  int find = 0;
  for (int i = 0; i < n - 1; i++)
    if (computer[i].a < computer[i + 1].a) {
      find = 1;
      break;
    }
  if (find == 1)
    printf("Happy Alex");
  else
    printf("Poor Alex");
}
