//Shirasu Azusa 2024.7
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;  
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=2e6+5; const double inf=1e18;
int n; double ans=inf;
struct node {double x,y;} a[N];
bool cmpx(const node &x,const node &y) {return x.x<y.x;}
bool cmpy(const node &x,const node &y) {return x.y<y.y;}
double dis(const node a,const node b) {
  return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

void work(int l,int r) {
  if(l==r) return; int mid=l+r>>1; double w=a[mid].x;
  work(l,mid), work(mid+1,r);
  static node p[N],q[N]; int x=0,y=0;
  rep(i,l,mid) if(w-a[i].x<ans) p[++x]=a[i];
  rep(i,mid+1,r) if(a[i].x-w<ans) q[++y]=a[i];
  for(int i=1,s=1,t=0;i<=x;i++) {
    while(s<=y&&p[i].y-q[s].y>ans) s++;
    while(t<y&&q[t+1].y-p[i].y<ans) t++;
    rep(j,s,t) chmin(ans,dis(p[i],q[j]));
  }
  inplace_merge(a+l,a+mid+1,a+r,cmpy);
}

signed main() {
  n=read();
  rep(i,1,n) a[i].x=read(), a[i].y=read();
  sort(a+1,a+n+1,cmpx); work(1,n);
  printf("%.8lf\n",ans);
  return 0;
}