#include <bits/stdc++.h>
 #define ll long long
 #define ull unsigned long long
 #define pi 3.141592654
 #define NUM 1e18
 #define Mod  1'000'000'007
 #define fixed(n) fixed<<setprecision(n)
 #define cin(v) for(auto &i:v) cin >> i ;
 #define cout(v) for(auto &i:v) cout << i  <<" ";
 #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
 #define small(x) (x>=97&&x<=122)
 #define capital(x) (x>=65&&x<=90)
 #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
 #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
 #define all(v) ((v).begin()), ((v).end())
 #define allr(v) ((v).rbegin()), ((v).rend())
 #define updmax(a,b) a=max(a,b)
 #define updmin(a,b) a=min(a,b)
 //#define ceil(a,b) ((a/b)+(a%b?1:0))
 /* asc -> 1 2 3 ,des -> 3 2 1 */
 /***********************************************************************************/
 using namespace std;
 void Rofyda_Elghadban(){
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
   #endif
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 }

 void solve(){
  int n,counter=0;
  cin>>n;
  vector<int>aa,bb,a1,b1;
  while(n--){
    int a,b;
    cin>>a>>b;
    aa.push_back(a);
    bb.push_back(b);
  }
  map<int,int>mpa,mpb;
  for(int i=0;i<aa.size();i++){
    mpa[aa[i]]=i;
    mpb[bb[i]]=i;
  }
  for(auto i:mpa){
    a1.push_back(i.first);
  }
  for(auto i:mpb){
    b1.push_back(i.first);
  }
  if(mpa[a1[aa.size()-1]]!=mpb[b1[bb.size()-1]]||mpa[a1[0]]!=mpb[b1[0]]){
    cout<<"Happy Alex"<<"\n";
  }else{
    cout<<"Poor Alex"<<"\n";
  }
 }

 int main(){
  Rofyda_Elghadban();
  // int t;
  // cin>>t;
  // while(t--){
  //   solve();
  // }
  solve();
  return 0;
 }