#include<iostream>
#include<math.h>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<vector>
using namespace std;
#define INF 100000000
#define maxn 100010
struct stu{
string gender;//gender这里表示名字 犯傻了
string sex;
string id;
int grade;
};
bool cmp(stu a,stu b)
{
return a.grade>b.grade;
}
int main()
{int num;
cin>>num;
vector<stu> male;
vector<stu> female;
for(int i=0;i<num;i++)
{
stu temp;
cin>>temp.gender>>temp.sex>>temp.id>>temp.grade;
if(temp.sex=="M") male.push_back(temp);
else female.push_back(temp);
}
sort(female.begin(),female.end(),cmp);
sort(male.begin(),male.end(),cmp);
if(!female.empty()) cout<<female[0].gender<<" "<<female[0].id<<endl;
else cout<<"Absent"<<endl;
if(!male.empty()) cout<<male[male.size()-1].gender<<" "<<male[male.size()-1].id<<endl;
else cout<<"Absent"<<endl;
if(!female.empty()&&!male.empty())
cout<<female[0].grade-male[male.size()-1].grade;
else cout<<"NA";
return 0;
}
