#include<bits/stdc++.h>
using namespace std;
int n;
struct ID47801000ms16MiB20152root{
	int hao,fen;
	string name;
};
ID47801000ms16MiB20152root a[110];
bool bijiao(ID47801000ms16MiB20152root a1,ID47801000ms16MiB20152root a2){
	if(a1.fen==a2.fen) return a1.hao<a2.hao;
	else return a1.fen>a2.fen;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i].hao>>a[i].name>>a[i].fen;
	sort(a+1,a+n+1,bijiao);
	for(int i=1;i<=n;i++) cout<<a[i].hao<<" "<<a[i].name<<" "<<a[i].fen<<endl;
	return 0;
}

#include<bits/stdc++.h> using namespace std; struct st{ int xh; string s; int fs; }; int n; st a[110]; bool cmp(st s1,st s2){ if(s1.fs==s2.fs){ return s1.xh<s2.xh; }else{ return s1.fs>s2.fs; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].xh>>a[i].s>>a[i].fs; } sort(a+1,a+1+n,cmp); for(int i=1;i<=n;i++){ cout<<a[i].xh<<" "<<a[i].s<<" "<<a[i].fs<<endl; } return 0; }

#include<bits/stdc++.h>
using namespace std;
struct st{
int xh;
string s;
int fs; 
};
int n;
st a[110];
bool cmp(st s1,st s2){
if(s1.fs==s2.fs){
return s1.xh<s2.xh;
}else{
return s1.fs>s2.fs;
}
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].xh>>a[i].s>>a[i].fs;
}
    sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++){
cout<<a[i].xh<<" "<<a[i].s<<" "<<a[i].fs<<endl;
}
return 0;
}