#include <bits/stdc++.h>
using namespace std;
const unsigned long long int oo = 1e9 + 5;
const int mx = 1e8;
bool g(pair<int, int> &p1, pair<int, int> &p2) { return (p1.first < p2.first); }
int main() {
  int n;
  scanf("%d", &n);
  vector<pair<int, int> > nums(n);
  for (int i = 0; i < int(n); ++i)
    scanf("%d %d", &nums[i].first, &nums[i].second);
  sort(nums.begin(), nums.end(), g);
  for (int j = 1; j < n; ++j) {
    if (nums[j].second < nums[j - 1].second) {
      printf("Happy Alex");
      return 0;
    }
  }
  printf("Poor Alex");
  return 0;
}
