#include <iostream>
#include <fstream>
#include <math.h>
#include <stdlib.h>
#include <climits>

std::ifstream fin("cmap.in");
std::ofstream fout("cmap.out");

struct vertex
{
    long long x, y;
};

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

void citire(int &n, vertex noduri[])
{
    fin>>n;
    for(int i = 0; i < n; i++)
    {
        //noduri[i] = new vertex;
        fin>>noduri[i].x>>noduri[i].y;
        //noduri[i].x += 1000000000;
        //noduri[i].y += 1000000000;
//        std::cout<<noduri[i].x<<' '<<noduri[i].y<<'\n';
    }
}

void rezolvare(int n, vertex noduri[])
{
    double minim = 100000000001;/// pow(10, 9) + 1;

    for(int i = 0; i < n - 1; i++)
    {
        for(int j = i + 1; j < n; j++)
        {
            double val = distance(noduri[i], noduri[j]);
            if(val < minim)
            {
                minim = val;
            }
        }
    }
    //std::cout<<minim<<'\n';
//    minim *= 100;
//    std::cout<<std::cout.precision(8)<<sqrt(abs(minim));
    //fout.precision(6);
    //fout<<sqrt(abs(minim))<<'\n';

    FILE *fout2 = fopen("cmap.out", "w");
    fprintf(fout2, "%.6lf\n", minim);
}

int main()
{
    int n;
    vertex noduri[100001];
    citire(n, noduri);
    rezolvare(n, noduri);
    return 0;
}