Problem: Find the diameter of a convex polygon g. In other words, find a pair of points that have maximum distance between them.

Constraints

* 3 ≤ n ≤ 80000
* -100 ≤ xi, yi ≤ 100
* No point in the g will occur more than once.

Input


n
x1 y1
x2 y2
:
xn yn


The first integer n is the number of points in g.

In the following lines, the coordinate of the i-th point pi is given by two real numbers xi and yi. The coordinates of points are given in the order of counter-clockwise visit of them. Each value is a real number with at most 6 digits after the decimal point.

Output

Print the diameter of g in a line. The output values should be in a decimal fraction with an error less than 0.000001.

Examples

Input

3
0.0 0.0
4.0 0.0
2.0 2.0


Output

4.00


Input

4
0.0 0.0
1.0 0.0
1.0 1.0
0.0 1.0


Output

1.414213562373

Solution (in CPP):

Solution:
#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;


#define EPS (1e-10)
#define equals(a, b) (fabs((a)-(b)) < EPS)

class Point {
 public:
  double x, y;

  Point(double x = 0, double y = 0): x(x), y(y) {}

  Point operator + (Point p) { return Point(x+p.x, y+p.y); }
  Point operator - (Point p) { return Point(x-p.x, y-p.y); }
  Point operator * (double a) { return Point(a*x, a*y); }
  Point operator / (double a) { return Point(x/a, y/a); }

  double norm() { return x*x+y*y; }
  double abs() { return sqrt(norm()); }

  bool operator < (const Point &p) const {
    return x != p.x ? x < p.x : y < p.y;
  }
  // bool operator < (const Point &p) const {
  //   return y != p.y ? y < p.y : x < p.x;
  // }

  bool operator == (const Point &p) const {
    return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;
  }
};

typedef Point Vector;
typedef vector <Vector> Polygon;

class Segment {
 public:
  Point p1, p2;

  Segment(Point p1 = Point(), Point p2 = Point()): p1(p1), p2(p2) {}
};

typedef Segment Line;

double norm(Vector a) {
  return a.x*a.x+a.y*a.y;
}

double abs(Vector a) {
  return sqrt(norm(a));
}

// ?????????|a||b|cos
double cross(Vector a, Vector b) {
  return a.x*b.y-a.y*b.x;
}
// ?????????|a||b|sin
double dot(Vector a, Vector b) {
  return a.x*b.x+a.y*b.y;
}

// 1:???????¨??????? -1:????¨??????? 2:p2-p0-p1 -2:p0-p1-p2 0:p2???p0-p1???
int ccw(Point p0, Point p1, Point p2) {
  Vector a = p1-p0;
  Vector b = p2-p0;
  if (cross(a, b) > EPS) return 1;
  if (cross(a, b) < -EPS) return -1;
  if (dot(a, b) < -EPS) return 2;
  if (a.norm() < b.norm()) return -2;

  return 0;
}

// ??????(??¢???????????\????????¢?????´??????????????????):????????????????????????????????????????°????????§???¢?????????
// ????????????????¨???????????????????????????????????????????????????§?????´?????????
Polygon andrewScan(Polygon s) {
  Polygon u, l;
  if (s.size() < 3) return s;
  sort(s.begin(), s.end());
  u.push_back(s[0]);
  u.push_back(s[1]);
  l.push_back(s[s.size()-1]);
  l.push_back(s[s.size()-2]);

  // ??????????????¨?????????
  for (int i = 2; i < s.size(); i++) {
    // ccw(u[n-2], u[n-1], s[i]) == 1:???????¨???????
    // ccw(u[n-2], u[n-1], s[i]) != -1:???????¨??????? and ???????????????????????????
    // ccw(u[n-2], u[n-1], s[i]) == -1:????¨???????
    // ccw(u[n-2], u[n-1], s[i]) != 1:????¨??????? and ???????????????????????????
    for (int n = u.size(); n >= 2 && ccw(u[n-2], u[n-1], s[i]) == 1; n--) {
      u.pop_back();
    }
    u.push_back(s[i]);
  }

  // ??????????????¨?????????
  for (int i = s.size()-3; i >= 0; i--) {
    // ccw(l[n-2], l[n-1], s[i]) == 1:???????¨???????
    // ccw(l[n-2], l[n-1], s[i]) != -1:???????¨??????? and ???????????????????????????
    // ccw(l[n-2], l[n-1], s[i]) == -1:????¨???????
    // ccw(l[n-2], l[n-1], s[i]) != 1:????¨??????? and ???????????????????????????
    for (int n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], s[i]) == 1; n--) {
      l.pop_back();
    }
    l.push_back(s[i]);
  }

  reverse(l.begin(), l.end());

  for (int i = u.size()-2; i >= 1; i--) l.push_back(u[i]);

  return l;
}

// ????§???¢???????????????????????????3?????\??????????????\?????§????????????????????¨????????¶???
bool isConvex(Polygon s) {
  int n = s.size();
  int a;
  for (int i = 0; i < n; i++) {
    a = ccw(s[i], s[(i+1)%n], s[(i+2)%n]);
    if (abs(a) == 1) break;
  }
  for (int i = 0; i < n; i++) {
    int b = ccw(s[i], s[(i+1)%n], s[(i+2)%n]);
    if (a*b < 0 && abs(b) == 1) {
      return false;
    }
  }
  return true;
}

// ????§???¢g??¨????????¢??????2:?????´???1:?????????0:?????´???????????§?????????????????????
int contains(Polygon g, Point p) {
  int n = g.size();
  bool x = false;
  for (int i = 0; i < n; i++) {
    Point a = g[i]-p, b = g[(i+1)%n]-p;
    if (abs(cross(a, b)) < EPS && dot(a, b) < EPS) return 1;
    if (a.y > b.y) swap(a, b);
    if (a.y < EPS && EPS < b.y && cross(a, b) > EPS) x = !x;
  }
  return (x ? 2 : 0);
}

// ????§???¢?????´???????±???????(?????£????????????)
double convex_diameter(Polygon p) {
  int n = p.size();
  int a, b;  // ????????????
  a = b = 0;
  for (int i = 1; i < n; i++) {
    if (p[i].y > p[a].y) a = i;
    if (p[i].y < p[b].y) b = i;
  }
  double ret = abs(p[a]-p[b]);

  int i, maxi, j, maxj;
  j = maxi = a;
  i = maxj = b;
  do {
    if (cross(p[(i+1)%n]-p[i], p[(j+1)%n]-p[j]) >= 0) j = (j+1)%n;
    else i = (i+1)%n;
    if (abs(p[i]-p[j]) > ret) {
      ret = abs(p[i]-p[j]);
      maxi = i; maxj = j;
    }
  }while (i != a || j != b);
  return ret;  // maxi??¨maxj???????????????
}

int main() {
  Polygon poly;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    double x, y;
    cin >> x >> y;
    poly.push_back(Vector(x, y));
  }
  cout << fixed << setprecision(20) << convex_diameter(poly) << endl;
}