#include <fstream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <climits>

using namespace std;

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

const int oo=INT_MAX;
const int NMax=100000;
pair<int,int> Point[NMax+5], NewPoint[NMax+5];
int x,y,K;
int N;

void Read(){
    fin >> N;
    for(int i=1;i<=N;++i){
        fin >> x >> y;
        Point[i]=make_pair(x,y);
    }
    sort(Point+1,Point+N+1);
}

long long dist(pair <int,int> a, pair<int,int> b){
    return (a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second);
}

int DEI(int Left,int Right){
    if(Left==Right){
        return oo;
    }
    if(Left==Right-1){
        return dist(Point[Left],Point[Right]);
    }
    int Mid=(Left+Right/2);
    long long A=DEI(Left,Mid);
    long long B=DEI(Mid,Right);
    long long Min = min(A,B);
    for(int i=Left,K=0;i<=Right;++i){
        if(abs(Point[i].first-Point[Mid].first)<Min){
            NewPoint[++K]=Point[i];
        }
    }
    for(int i=1;i<=K;++i){
        for(int j=i+1;j<=K;j++){
            Min=min(Min,dist(NewPoint[i],NewPoint[j]));
        }
    }
}

int main()
{
    Read();
    fout << fixed << setprecision(6) << sqrt(DEI(1,N)) << "\n";
    return 0;
}