```import java.util.Scanner;

public class FindNearestPoints {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter the number of points: ");
int numberOfPoints = input.nextInt();

// Create an array to store points
double[][] points = new double[numberOfPoints];
System.out.print("Enter " + numberOfPoints + " points: ");
for (int i = 0; i < points.length; i++) {
points[i] = input.nextDouble();
points[i] = input.nextDouble();
}

// p1 and p2 are the indices in the points array
int p1 = 0, p2 = 1; // Initial two points
double shortestDistance = distance(points[p1], points[p1],
points[p2], points[p2]); // Initialize shortestDistance

// Compute distance for every two points
for (int i = 0; i < points.length; i++) {
for (int j = i + 1; j < points.length; j++) {
double distance = distance(points[i], points[i],
points[j], points[j]); // Find distance

if (shortestDistance > distance) {
p1 = i; // Update p1
p2 = j; // Update p2
shortestDistance = distance; // Update shortestDistance
}
}
}

// Display result
System.out.println("The closest two points are " +
"(" + points[p1] + ", " + points[p1] + ") and (" +
points[p2] + ", " + points[p2] + ")");
}

/** Compute the distance between two points (x1, y1) and (x2, y2)*/
public static double distance(
double x1, double y1, double x2, double y2) {
return Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
}
}
```