#include <bits/stdc++.h>
using namespace std;
int xi, yi, x2, y2, t, x, g, y, h1, h2, m1, m2, s1, s2;
map<int, int> mp;
vector<int> v1;
vector<int> v2;
vector<int> v3;
vector<int> v5;
set<int> c1;
char s[101][101];
int a[105];
int f, c, v, m, i = 0;
long long ans;
int main() {
  set<pair<int, int> > ss;
  int n;
  cin >> n;
  while (n--) {
    cin >> x >> y;
    ss.insert(make_pair(x, y));
  }
  set<pair<int, int> >::iterator it = ss.begin();
  for (; it != ss.end(); ++it) {
    set<pair<int, int> >::iterator it2 = ++it;
    --it;
    if (it->first < it2->first && it->second > it2->second) {
      cout << "Happy Alex" << endl;
      return 0;
    }
  }
  cout << "Poor Alex" << endl;
  return 0;
}
