/// SOLUTIE INSPIRATA DUPA USU
#include <fstream>
#include <algorithm>
#include <climits>
#define x first
#define y second
std::pair<int,int> v[100005];
long long dist_p(int a,int b){
    return 1LL*(v[a].x-v[b].x)*(v[a].x-v[b].x)+1LL*(v[a].y-v[b].y)*(v[a].y-v[b].y);
}
int main(){
    freopen("cmap.in","r",stdin);
    freopen("cmap.out","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;++i)
        scanf("%d %d",&v[i].x,&v[i].y);
    std::sort(v+1,v+n+1);
    long long Min=LLONG_MAX;
    for(int i=1;i<=n;++i)
        for(int j=i+1;j<=n;++j){
            if(1LL*(v[j].x-v[i].x)*(v[j].x-v[i].x)>Min)
                break;
            long long d=dist_p(i,j);
            if(d<Min) Min=d;
    }
    printf("%.6f",sqrt(Min) );
    return 0;}