#include <bits/stdc++.h>
using namespace std;
int N;
pair<int, int> A[100005];
int main() {
  int i, j;
  cin >> N;
  for (i = 1; i <= N; i++) cin >> A[i].first >> A[i].second;
  sort(A + 1, A + N + 1);
  for (i = 2; i <= N; i++)
    if (A[i].first > A[i - 1].first && A[i].second < A[i - 1].second) {
      puts("Happy Alex");
      return 0;
    }
  puts("Poor Alex");
}
