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

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

struct vertex
{
    int x, y;
};

int distance(vertex *a, vertex *b)
{
    return (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;
//        std::cout<<noduri[i]->x<<' '<<noduri[i]->y<<'\n';
    }
}

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

    for(int i = 0; i < n - 1; i++)
    {
        for(int j = i + 1; j < n; j++)
        {
            int val = distance(noduri[i], noduri[j]);
            if(val < minim)
            {
                minim = val;
            }
        }
    }
    fout<<sqrt(abs(minim))<<'\n';
}

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