fj

#include <iostream>
#include <algorithm>
using namespace std;

struct node{

int b,c;

}a[200000];
bool cmp(node i,node j){
if(i.c!=j.c){
return i.c>j.c;
} else{
return i.b<j.b;
}
}
int main(){
int n;
cin >> n;
for(int i = 1;i <=n;i++){
cin >>a[i].b;
a[i].c=a[i].b%10;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++){
cout<<a[i].b<<endl;
}
return 0;
}