Valuable Resources

题意翻译

有$n$个点，给定坐标，用最小的平行于坐标轴的正方形将它们全部框起来，求该正方形的面积。

题目描述

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.

输入输出格式

输入格式

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.

输出格式

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

输入输出样例

输入样例 #1

2
0 0
2 2

输出样例 #1

4

输入样例 #2

2
0 0
0 3

输出样例 #2

9

题意翻译

有$n$个点，给定坐标，用最小的平行于坐标轴的正方形将它们全部框起来，求该正方形的面积。