#include #define FOR(v, a, b) for(int v = (a); v < (b); ++v) #define FORE(v, a, b) for(int v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(int v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define LLI long long int #define fst first #define snd second #ifdef DEBUG #include #else #define dump(x) #endif #define gcd __gcd using namespace std; template constexpr T lcm(T m, T n){return m/gcd(m,n)*n;} template void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost< istream& operator>>(istream &is, vector &v){for(auto &a : v) is >> a; return is;} template istream& operator>>(istream &is, pair &p){is >> p.first >> p.second; return is;} template T& chmin(T &a, const U &b){return a = (a<=b?a:b);} template T& chmax(T &a, const U &b){return a = (a>=b?a:b);} template void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} int main(){ cin.tie(0); ios::sync_with_stdio(false); int n; while(cin >> n){ vector> b(n); cin >> b; sort(ALL(b)); for(auto &p : b){ cout << p.fst << " " << p.snd << endl; } } return 0; }