#define  _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
using namespace std;
#include <vector>
#include <set>
#include <map>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <list>
#include <string>
#include <cmath>
#include <bitset>
#include <stack>
#include <math.h>
#include <functional>
#define ull             unsigned long long 
#define ll              long long
#define pll             pair<ll ,ll>
#define ft              first
#define sd              second
#define cy              cout<<"YES"<<endl
#define cn              cout<<"NO"<<endl
#define forn(i,n)       for(ll (i)=0;(i)<(n);(i)++)   
#define forne(i,n)      for(ll (i)=1;(i)<=(n);(i)++)
#define rforn(i,n)      for(ll (i)=(n-1);i>=0;i--)
#define rforne(i,n)     for(ll (i)=n;i>=1;i--)
#define vv              vector
#define inf32           INT32_MAX
#define inf64           INT64_MAX
#define LD              long double 
const int N = 4e5 + 100;
const int mod = 998244353;
ll T;

//点类
struct Point {
	LD x, y;
	Point(LD x, LD y) { this->x = x;	this->y = y; }
	Point() {}
#define line Point 
	//点的加减乘运算
	Point operator+(Point b) { return Point(this->x + b.x, this->y + b.y); }
	Point operator-(Point b) { return Point(this->x - b.x, this->y - b.y); }
	Point operator*(LD t) { return Point(this->x * t, this->y * t); }
	LD operator*(Point b) { return this->x * b.x + this->y * b.y; }
	bool operator==(Point b) { return this->x == b.x && this->y == b.y; }
};
class Geomtry_tool {
public:
	//求长度
	static LD len(line a) { return sqrt(a.x * a.x + a.y * a.y); }
	//求两点距离
	LD dis(Point a, Point b) { return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); }
	//两个向量求角度，使用的是余弦定理求arccos
	static LD angle(line a, line b) { return acos(a * b / len(a) / len(b)); }
	//两个向量求叉积
	static LD cross(line a, line b) { return a.x * b.y - a.y * b.x; }
	//epslion，判断是否等于0
	static int sgn(LD x) { LD eps = 1e-10; return abs(x) <= eps ? 0 : x > 0 ? 1 : -1; }
	//可以用来判断c在b的左侧还是右侧
	//大于0，c在ab左侧；小于0，c在ab右侧；等于0，三点共线
	static LD cross(Point a, Point b, Point c) { return cross(b - a, c - a); }
	//判断直线与线段的交点情况，在同侧则无交点；
	//如果是判断线段与线段有无交点，则需要分别设ab，cd为直线，进行两次判断
	static bool l_S_inter(Point a, Point b, Point c, Point d) {
		return sgn(cross(a, b, c) * cross(a, b, d)) <= 0;//直线与线段
	}
	//线段与线段
	static bool S_S_inter(Point a, Point b, Point c, Point d) {
		return l_S_inter(a, b, c, d) && l_S_inter(c, d, a, b);
	}
	//求两直线的交点
	static Point getNode(Point a, line u, Point b, line v) {
		LD t = cross((a - b), v) / cross(v, u);//求面积之比
		return a + u * t;
	}
	static Point rotate(Point a, double b) { //将某点绕原点逆时针旋转b角度
		return { a.x * cos(b) - a.y * sin(b), a.x * sin(b) + a.y * cos(b) };
	}
};
//凸包
class Andrew {
	Geomtry_tool fn;
public:
	int top = 0;
	struct cmp {
		bool operator()(const Point& a, const Point& b) {
			return a.x == b.x ? a.y < b.y : a.x < b.x;
		}
	};
	LD Andrew_lenth(vv<Point>& p, vv<Point>& s) {
		int n = p.size();
		sort(p.begin(), p.end(), cmp());
		s.resize(p.size() + 2);
		//最左下和最右上的两个点一定是在凸包上的
		forn(i, n) {//下凸包
			while (top > 1 && fn.sgn(fn.cross(s[top - 1], s[top], p[i]) <= 0))
				top--;
			s[++top] = p[i];
		}
		int t = top;
		for (int i = n - 2; i >= 0; i--) {//上凸包
			while (top > t && fn.sgn(fn.cross(s[top - 1], s[top], p[i])) <= 0)
				top--;
			s[++top] = p[i];
		}
		LD res = 0;
		for (int i = 1; i < top; i++)
			res += fn.dis(s[i], s[i + 1]);
		return res;
	}
	//旋转卡壳
	LD rotating_calipers(vv<Point>& s) {
		int n = top - 1;
		LD res = 0;
		for (int i = 1, j = 2; i <= n; i++) {
			while (fn.cross(s[i], s[i + 1], s[j])
				< fn.cross(s[i], s[i + 1], s[j % n + 1]))
				j = j % n + 1;
			res = max(res, max(fn.dis(s[i], s[j])
				, fn.dis(s[i + 1], s[j])));
		}
		return res;
	}
};
void solve() {

	int n; cin >> n;
	vv<Point>nums(n);
	forn(i, n)
		cin >> nums[i].x >> nums[i].y;
	Andrew aw;
	vv<Point >rs(n);
	aw.Andrew_lenth(nums, rs);
	LD ans = aw.rotating_calipers(rs);
	cout<<ans*ans<< endl;
}
int main() {

	//std::ios::sync_with_stdio(false);
	T = 1;
	//cin >> T;

	while (T--)
		solve();

}