#include <bits/stdc++.h>
long long gcd(long long first, long long second) {
  return !second ? first : gcd(second, first % second);
}
long long lcm(long long first, long long second) {
  return (first / gcd(first, second)) * second;
}
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int M6 = 1e6 + 5, M5 = 1e5 + 5;
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<pair<int, int> > v(n);
  for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    if (!i) continue;
    if (v[i].first > v[i - 1].first && v[i].second < v[i - 1].second)
      return cout << "Happy Alex" << '\n', 0;
  }
  cout << "Poor Alex" << '\n';
}
