CF485B.Valuable Resources

Many computer strategy games require building cities, recruiting army, conquering tribes, collecting resources. Sometimes it leads to interesting problems.

Let's suppose that your task is to build a square city. The world map uses the Cartesian coordinates. The sides of the city should be parallel to coordinate axes. The map contains mines with valuable resources, located at some points with integer coordinates. The sizes of mines are relatively small, i.e. they can be treated as points. The city should be built in such a way that all the mines are inside or on the border of the city square.

Building a city takes large amount of money depending on the size of the city, so you have to build the city with the minimum area. Given the positions of the mines find the minimum possible area of the city.

许多电脑策略游戏要求建造城市、招募军队、征服部落、收集资源。有时这会引出一些有趣的问题。

假设你的任务是建造一座正方形城市。世界地图采用笛卡尔坐标系，城市的四边应与坐标轴平行。地图上分布着若干蕴藏宝贵资源的矿场，其位置为一些整数坐标的点。矿场的尺寸相对较小，因此可将其视为点。城市必须建造得足够大，使得所有矿场均位于城市正方形的内部或边界上。

建造城市的成本取决于城市的面积大小，因此你需要建造面积最小的城市。给定所有矿场的位置，请找出满足条件的最小可能城市面积。

The first line of the input contains number n — the number of mines on the map (2 ≤ n ≤ 1000). Each of the next n lines contains a pair of integers x__i and y__i — the coordinates of the corresponding mine ( - 109 ≤ x__i, y__i ≤ 109). All points are pairwise distinct.

输入的第一行包含一个整数 $n$ —— 地图上地雷的数量（$2 \leq n \leq 1000$）。接下来的 $n$ 行中，每行包含一对整数 $x_i$ 和 $y_i$ —— 对应地雷的坐标（$-10^9 \leq x_i, y_i \leq 10^9$）。所有点两两互不相同。

Print the minimum area of the city that can cover all the mines with valuable resources.

输出能够覆盖所有富含资源矿藏的城市的最小面积。