#include using namespace std; typedef long long ll; typedef pair lpair; const ll MOD = 1e9 + 7; const ll INF = 1e18; #define rep(i,m,n) for(ll i = (m); i < (n); i++) #define rrep(i,m,n) for(ll i = (m); i >= (n); i--) #define print(x) cout << (x) << endl; #define print2(x,y) cout << (x) << " " << (y) << endl; #define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " ";} cout< p1, pair p2){ if(p1.first == p2.first){ return p1.second < p2.second; } return p1.first < p2.first; } int main(){ cin.tie(0); ios::sync_with_stdio(false); ll N; cin >> N; string S[30], id[30]; vector< pair >lp; rep(i,0,N){ cin >> S[i] >> id[i]; lp.push_back(make_pair(S[i], id[i])); } sort(lp.begin(), lp.end(), comp); rep(i,0,N){ cout << lp[i].first << " " << lp[i].second << endl; } }