#include<fstream>
#include<cstdio>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define ll long long
#define inf (1<<30)
#define base 256
#define ba 255
#define N 100100
#define EPS 1e-12
#define mod  666013
#define inu "cmap.in"
#define outu "cmap.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
pair<double,double> v[N];
double dist(int a,int b)
{
	return sqrt( (v[a].x-v[b].x)*(v[a].x-v[b].x)+ (v[b].y-v[a].y)*(v[b].y-v[a].y) );
}
int n;
int main ()
{
    f>>n;
    FOR(i,1,n)
    f>>v[i].x>>v[i].y;
    sort(v+1,v+n+1);
    double dmin=0x3f3f3f3f;
    FOR(i,1,n)
    FOR(j,i+1,n)
    {
    	if(v[j].x-v[i].x>dmin)
    	break;
    	if(dist(i,j)<dmin)
    	dmin=dist(i,j);
    }
    g<<fixed<<setprecision(6)<<dmin;
    return 0;
}