#include<bits/stdc++.h>

#define mk make_pair

#define fi first

#define se second

#define pb push_back

using namespace std;

const double eps=1e-;

const double INF=1e18;

int Sign(double x)

{

    if(x<-eps) return -;

    if(x>eps) return ;

    return ;

}

int Cmp(double x,double y){return Sign(x-y);}

struct Point

{

    double x,y;

    Point(double _x=,double _y=):x(_x),y(_y){}

    Point operator+(const Point &o)const{return Point(x+o.x,y+o.y);}

    Point operator-(const Point &o)const{return Point(x-o.x,y-o.y);}

    Point operator*(double k)const{return Point(x*k,y*k);}

    Point operator/(double k)const{return Point(x/k,y/k);}

    int operator==(const Point &o)const{return Cmp(x,o.x)== && Cmp(y,o.y)==;}

    bool operator<(const Point &o)const

    {

        int sgn=Cmp(x,o.x);

        if(sgn==-) return ;

        else if(sgn==) return ;

        else return Cmp(y,o.y)==-;

    }

    void print(){printf("%.11f %.11f\n",x,y);}

};

typedef Point Vctor;

//叉积

double Cross(Vctor A,Vctor B){return A.x*B.y-A.y*B.x;}

double Cross(Point O,Point A,Point B){return Cross(A-O,B-O);}

//距离

double Dot(Vctor A,Vctor B){return A.x*B.x+A.y*B.y;}

double Length(Vctor A){return sqrt(Dot(A,A));}

double Length(Point A,Point B){return Length(A-B);}

vector<Point> ConvexHull(vector<Point> P,int flag=) //flag=0不严格 flag=1严格

{

    if(P.size()<=) return P;

    int sz=P.size();

    vector<Point> ans(*sz);

    sort(P.begin(),P.end());

    int now=-;

    for(int i=;i<sz;i++)

    {

        while(now> && Sign(Cross(ans[now]-ans[now-],P[i]-ans[now-]))<flag) now--;

        ans[++now]=P[i];

    }

    int pre=now;

    for(int i=sz-;i>=;i--)

    {

        while(now>pre && Sign(Cross(ans[now]-ans[now-],P[i]-ans[now-]))<flag) now--;

        ans[++now]=P[i];

    }

    ans.resize(now);

    return ans;

}

double RotatingCalipers(const vector<Point> &P) //旋转卡壳法

{

    double ans=INF;

    int sz=P.size();

    for(int i=,q=;i<sz;i++)

    {

        int j=(i+)%sz;

        while( Cross(P[j]-P[i],P[q]-P[i]) < Cross(P[j]-P[i],P[(q+)%sz]-P[i]) ) q=(q+)%sz;

        double d=fabs(Cross(P[i],P[j],P[q]))/Length(P[i],P[j]);

        ans=min(ans,d);

    }

    return ans;

}

int n;

vector<Point> P;

int main()

{

    cin>>n;

    for(int i=;i<=n;i++)

    {

        double x,y; cin>>x>>y;

        P.pb(Point(x,y));

    }

    double ans=RotatingCalipers(ConvexHull(P));

    printf("%.8f\n",ans);

}