Problem:
Sorting Pairs

Write a program which print coordinates $(x_i, y_i)$ of given $n$ points on the plane by the following criteria.

first by $x$-coordinate

in case of a tie, by $y$-coordinate

Input

The input is given in the following format.

$n$
$x_0 \; y_0$
$x_1 \; y_1$
:
$x_{n-1} \; y_{n-1}$

In the first line, the number of points $n$ is given. In the following $n$ lines, coordinates of each point are given.

Output

Print coordinate of given points in order.

Constraints

$1 \leq n \leq 100,000$

$-1,000,000,000 \leq x_i, y_i \leq 1,000,000,000$

Sample Input 1

5
4 7
5 5
2 3
6 8
2 1

Sample Output 1

2 1
2 3
4 7
5 5
6 8

Solution in Python3 (judge verdict: Accepted)

def resolve():
    n = int(input())
    xxyy = [list(map(int, input().split())) for _ in range(n)]
    xxyy = sorted(xxyy, key=lambda x: x[1])
    xxyy = sorted(xxyy, key=lambda x: x[0])
    for xy in xxyy:
        print(*xy)


resolve()