#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n;
const int N=1e6+5;
struct Node{
    int x,y;
}a[N];
double get_dis1(Node x,Node y){
    return 1ll*abs(x.x-y.x)+abs(x.y-y.y);
}
double get_dis2(Node x,Node y){
    return sqrt(1ll*(x.x-y.x)*(x.x-y.x)+1ll*(x.y-y.y)*(x.y-y.y));
}
double calc(Node x,Node y){
    return 1.0*get_dis1(x,y)/get_dis2(x,y);
}
double ans1=1e18,ans2=0;
bool cmp1(Node x,Node y){
    return x.x<y.x;
}
bool cmp2(Node x,Node y){
    return x.y<y.y;
}
bool cmp3(Node x,Node y){
    return x.x+x.y<y.x+y.y;
}
bool cmp4(Node x,Node y){
    return x.x-x.y<y.x-y.y;
}
bool cmp5(Node x,Node y){
    return x.y-x.x<y.y-y.x;
}
bool cmp6(Node x,Node y){
    return abs(x.x-x.y)<abs(y.x-y.y);
}
bool cmp7(Node x,Node y){
    return 1ll*x.x*x.y<1ll*y.x*y.y;
}
bool cmp8(Node x,Node y){
    return 1.0*x.x/x.y<1.0*y.x/y.y;
}
bool cmp9(Node x,Node y){
	return 1.0*x.y/x.x<1.0*y.y/y.x;
}
void solve(){
    for(int i=1;i<=n;i++){
    	if(i>1){
    		ans1=min(ans1,calc(a[i],a[i-1]));
            ans2=max(ans2,calc(a[i],a[i-1]));
		}
        if(i<n){
        	ans1=min(ans1,calc(a[i],a[i+1]));
            ans2=max(ans2,calc(a[i],a[i+1]));
		}
    }
    return;
}
signed main(){
    //freopen("apricot.in","r",stdin);
    //freopen("apricot.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d %d",&a[i].x,&a[i].y);
    sort(a+1,a+n+1,cmp1);
    solve();
    sort(a+1,a+n+1,cmp2);
    solve();
    sort(a+1,a+n+1,cmp3);
    solve();
    sort(a+1,a+n+1,cmp4);
    solve();
    sort(a+1,a+n+1,cmp5);
    solve();
    sort(a+1,a+n+1,cmp6);
    solve();
    sort(a+1,a+n+1,cmp7);
    solve();
    sort(a+1,a+n+1,cmp8);
    solve();
    sort(a+1,a+n+1,cmp9);
    solve();
    printf("%.20lf\n",ans1);
    return 0;
}