#include <bits/stdc++.h>
using namespace std;
int r[100000], n;
int r1[100000];
void qsort(int l, int ri) {
  int x = r[(l + ri) / 2];
  int i = l;
  int j = ri;
  do {
    while (r[i] < x) ++i;
    while (r[j] > x) {
      --j;
    }
    if (i <= j) {
      swap(r[i], r[j]);
      swap(r1[i], r1[j]);
      ++i;
      --j;
    }
  } while (i <= j);
  if (j > l) qsort(l, j);
  if (i < ri) qsort(i, ri);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> r[i] >> r1[i];
  }
  qsort(0, n - 1);
  for (int i = 0; i < n - 1; ++i) {
    if (r[i] < r[i + 1] && r1[i] > r1[i + 1]) {
      cout << "Happy Alex";
      return 0;
    }
  }
  cout << "Poor Alex";
  return 0;
}
