#include <bits/stdc++.h>
using namespace std;

const int maxN = (int)1e5+1;

int n;
array<int,2> points[maxN];  // (x,y)

//

//
//  First, compare x-coordinates, break ties with y-coordinates
//
bool cmp( array<int,2> &a, array<int,2> &b )
{
    return a[0] == b[0] ? a[1] < b[1] : a[0] < b[0];
}

//

int main()
{
    int i,j,k;

    cin >> n;
    for(i=0; i<n;i++)
        cin >> points[i][0] >> points[i][1];

    sort(points, points+n, cmp);

    for(i=0;i<n;i++)
        printf("(%d,%d) \n", points[i][0], points[i][1]);
    printf("\n");

    return 0;
}