#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > Q;
int main() {
  Q = vector<vector<int> >(100003);
  int n, a, b;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a >> b;
    Q[a].push_back(b);
  }
  bool found = 0;
  int Max1 = -1;
  for (int i = 0; i < 100002; i++) {
    int Max2 = -1;
    for (int j = 0; j < Q[i].size(); j++) {
      if (Max1 > Q[i][j]) {
        found = 1;
        break;
      }
      Max2 = max(Max2, Q[i][j]);
    }
    Max1 = max(Max1, Max2);
    if (found) break;
  }
  if (found) {
    puts("Happy Alex");
  } else {
    puts("Poor Alex");
  }
}
