//{{{
#include <bits/stdc++.h>
using namespace std;
//types
typedef long long ll;
typedef pair<int,int> pii;
//input
bool SR(int &_x){return scanf("%d",&_x)==1;}bool SR(ll &_x){return scanf("%lld",&_x)==1;}
bool SR(double &_x){return scanf("%lf",&_x)==1;}bool SR(char *_s){return scanf("%s",_s)==1;}
bool RI(){return true;}
template<typename I,typename... T>bool RI(I &_x,T&... _tail){return SR(_x) && RI(_tail...);}
//output
void SP(const int _x){printf("%d",_x);}void SP(const ll _x){printf("%lld",_x);}
void SP(const double _x){printf("%.16lf",_x);}void SP(const char *s){printf("%s",s);}
void PL(){puts("");}
template<typename I,typename... T>void PL(const I _x,const T... _tail)
{SP(_x);if(sizeof...(_tail)) putchar(' ');PL(_tail...);}
//macro
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<int(n);i++)
#define REP1(i,a,b) for(int i=(a);i<=int(b);i++)
#define PER1(i,a,b) for(int i=(a);i>=int(b);i--)
#define pb push_back
#define mkp make_pair
#define F first
#define S second
//debug
#ifdef darry140
template<typename A,typename B>
ostream& operator <<(ostream&_s, const pair<A,B> &_p){return _s<<"("<<_p.F<<","<<_p.S<<")";}
template<typename It>
ostream& _OUTC(ostream &_s,It _b,It _e)//container
{
    _s<<"{";
    for(auto _it=_b;_it!=_e;_it++) _s<<(_it==_b?"":" ")<<*_it;
    _s<<"}";
    return _s;
}
template<typename A,typename B>
ostream& operator <<(ostream&_s, const map<A,B> &_c){return _OUTC(_s,ALL(_c));}
template<typename T>
ostream& operator <<(ostream&_s, const set<T> &_c){return _OUTC(_s,ALL(_c));}
template<typename T>
ostream& operator <<(ostream&_s, const vector<T> &_c){return _OUTC(_s,ALL(_c));}
template<typename I>
void _DOING(const char *_s,I&& _x){cerr<<_s<<"="<<_x<<endl;}//without ','
template<typename I,typename... T>
void _DOING(const char *_s,I&& _x,T&&... _tail)//with ','
{
    int _c=0;
    static const char _bra[]="({[";
    static const char _ket[]=")}]";
    while(*_s!=',' || _c!=0)//eg. mkp(a,b)
    {
        if(strchr(_bra,*_s)) _c++;
        if(strchr(_ket,*_s)) _c--;
        cerr<<*_s++;
    }
    cerr<<"="<<_x<<", ";
    _DOING(_s+1,_tail...);
}
#define debug(...) do{\
    fprintf(stderr,"%s:%d - ",__PRETTY_FUNCTION__,__LINE__);\
    _DOING(#__VA_ARGS__,__VA_ARGS__);\
}while(0)
#else
#define debug(...)
#endif
//}}}
typedef long double ld;
const ld global_eps=1e-8;
#if 0
enum cases{insi,bord,outs};//inside, border, outside
enum cases{para,coin,inte};//parallel, coincide, intersect
#else
enum Case
{
    insi,bord,outs,//inside, border, outside
    para,coin,inte, //parallel, coincide, intersect
    tang,tang_in,tang_out //tangent
};
#endif
int sign(ld x,ld eps=global_eps){return (x>=eps)-(x<=-eps);}
int cmp(ld a,ld b,ld eps=global_eps){return sign(a-b,eps);}
struct Point
{
    ld x,y;
    Point():x(0),y(0){}
    Point(ld _x,ld _y):x(_x),y(_y){}
    Point operator +(const Point &p) const
    {return Point(x+p.x,y+p.y);}
    Point operator -(const Point &p) const
    {return Point(x-p.x,y-p.y);}
    ld operator *(const Point &p) const
    {return x*p.x+y*p.y;}
    ld operator %(const Point &p) const
    {return x*p.y-y*p.x;}   
    bool operator <(const Point &p) const
    {return tie(y,x) < tie(p.y,p.x);}
    bool operator ==(const Point &p) const
    {return tie(y,x) == tie(p.y,p.x);}
    Point operator /(const ld &l) const
    {return Point(x/l,y/l);}
    Point operator *(const ld &l) const
    {return Point(x*l,y*l);}
    ld len() const{return hypot(x,y);}
    ld len2() const{return x*x+y*y;}
    ld dis(const Point &a)const{return (*this-a).len();}
    ld dis2(const Point &a)const{return (*this-a).len2();}
    Point unit()const{return *this/len();}
    Point resize(const ld &l)const{return unit()*l;}
};
struct Line
{
    Point p1,p2;
    Line(){}
    Line(Point a,Point b):p1(a),p2(b){}
    Point way() const{return p2-p1;}
    Point norm() const{return {p1.y-p2.y,p2.x-p1.x};}
    bool online(const Point &p) const{return sign((p-p1)%way())==0;}
    bool onsegment(const Point &p)const
    {
        return online(p) && sign((p-p1)*(p2-p))>=0;
    }
    pair<int,Point> intersect(const Line &I) const
    {
        if(sign(I.way()%way())==0) return {online(I.p1)?coin:para,{0,0}};
        const Point &p3=I.p1,&p4=I.p2;
        auto _143=(p1-p4)%(p4-p3),_342=(p3-p4)%(p4-p2);
        return {inte,(p1*_342+p2*_143)/(_143+_342)};
    }
    ld linedistance(const Point &p) const
    {
        return abs((p-p1)%way())/way().len();
    }
    Point project(const Point &p) const
    {
        return intersect(Line(p,p+norm())).second;
    }
    ld segmentdistance(const Point &p) const
    {
        const auto &pro=project(p);
        if(onsegment(pro)) return p.dis(pro);
        return min(p.dis(p1),p.dis(p2));
    }
};
int main()
{
    int n;RI(n);
    vector<Point> v(n);
    REP(i,n)
    {
        double x,y;RI(x,y);
        v[i]=Point(x,y);
    }
    vector<Point> v2(v);
    v2.insert(v2.end(),ALL(v));
    auto it=v2.begin()+1;
    ld ans=0;
    REP(i,n)
    {
        while(next(it)!=v2.end() && cmp(v[i].dis(*it),v[i].dis(*next(it))) < 0) it++;
        debug(i,it-v2.begin());
        ans=max(ans,v[i].dis(*it));
    }
    PL((double)ans);
    return 0;
}

Measured memory_bytes: 12908