#include<bits/stdc++.h> using namespace std; struct name{string fir,sec;int id;}a[50005]; map<string,int>num; int n; inline bool cmp(name a,name b) { if(a.fir!=b.fir) return num[a.fir]>num[b.fir]; else return a.id<b.id; } int main() { cin>>n; for(int i=1;i<=n;++i) { cin>>a[i].fir>>a[i].sec; ++num[a[i].fir],a[i].id=i; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;++i) cout<<a[i].fir<<" "<<a[i].sec<<endl; }