- Time limit: 1.00 s
- Memory limit: 512 MB
Given a set of points in the two-dimensional plane, your task is to find the minimum Euclidean distance between two distinct points.
The Euclidean distance of points and is .
Input
The first input line has an integer : the number of points.
After this, there are lines that describe the points. Each line has two integers and . You may assume that each point is distinct.
Output
Print one integer: where is the minimum Euclidean distance (this ensures that the result is an integer).
Constraints
Example
Input:
4 2 1 4 4 1 2 6 3
Output:
2