#include <bits/stdc++.h>
using namespace std;
long long n, m, p, k, i, j;
pair<long long, long long> a[500000];
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
  sort(a + 1, a + 1 + n);
  for (i = 1; i < n; i++) {
    if (a[i].first != a[i].second) {
      cout << "Happy Alex";
      return 0;
    }
  }
  cout << "Poor Alex";
  return 0;
}
