#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define x first
#define y second
#define pt pair <long long, long long>

using namespace std;

ifstream cin ("cmap.in");
ofstream cout("cmap.out");

vector <pt> a;

void read()
{
    int n, x, y;
    cin >> n;
    a.resize(n);

    for (int i = 0; i < a.size(); i++)
        cin >> a[i].x >> a[i].y;
}

bool f(pt a, pt b)
{
    return a.x < b.x;
}

double dist(pt a, pt b)
{
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}

double solve()
{
    sort(a.begin(), a.end(), f);

    double d = dist(a[0], a[1]);

    for (int i = 0; i < a.size(); i++)
        for (int j = i + 1; a[j].x - a[i].x < d && j < a.size(); j++)
            d = min(d, dist(a[i], a[j]));

    return d;
}

int main()
{
    read();

    cout << fixed << setprecision(10) << solve() ;

    return 0;
}