#include <bits/stdc++.h>
const int MAXN = (int)1e5 + 5;
const int MODN = (int)1e9 + 7;
int inf = 0x3f3f3f3f;
using namespace std;
char str[MAXN];
int num[MAXN];
int a[MAXN];
struct Com {
  int cost;
  int qua;
} c[MAXN];
int cmp(Com a, Com b) { return a.cost < b.cost; }
int main() {
  int n, m;
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; i++) {
      scanf("%d%d", &c[i].cost, &c[i].qua);
    }
    sort(c, c + n, cmp);
    int flag = 0;
    for (int i = 1; i < n; i++) {
      if (c[i].qua < c[i - 1].qua && c[i].cost > c[i - 1].cost) {
        flag = 1;
      }
    }
    if (flag)
      puts("Happy Alex");
    else
      puts("Poor Alex");
  }
}
