Need help with a Design and Analysis of Algorithms problem:

Let A1.. be an array of points in the plane, where Ali] contains the coordinates (zi,Vi) of a point Pi, for i = 1, ,n. Give an 0(n lg n) time algorithm that determines whether any two points in A are iden- tical (that is, have the same a and y coordinates)