Sorting Coordinates 2

You are given $N$ points on a two dimensional plane. Write a program that sorts the points by increasing $y$ coordinate, breaking ties by increasing $x$ coordinate, and prints the sorted points.

The first line contains the number of points $N$ ($1 \le N \le 100000$). Each of the next $N$ lines contains the coordinates $x_i$ and $y_i$ of the $i$-th point, separated by a space ($-100000 \le x_i, y_i \le 100000$). All coordinates are integers, and no two points share the same position.

Print the sorted points on $N$ lines, one point per line. On each line print the $x$ coordinate and the $y$ coordinate of that point, separated by a single space.