#include <iostream> #include <vector> #include <algorithm> using namespace std; struct Pair { int first; int second; }; bool comparePairs(const Pair& a, const Pair& b) { if (a.first != b.first) return a.first < b.first; return a.second < b.second; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<Pair> pairs(n); for (int i = 0; i < n; ++i) { cin >> pairs[i].first >> pairs[i].second; } sort(pairs.begin(), pairs.end(), comparePairs); for (const auto& p : pairs) { cout << p.first << " " << p.second << "\n"; } return 0; }