在一个平面上有n(1<=n<=100000)个村庄，每个村庄通过坐标(xi,yi)标示位置,-10^9<=xi,yi<=10^9。现在想要建一个邮局，使得到各个村庄的距离之和最短。



在这个问题中，距离定义为曼哈顿距离，即点i和点j的距离等于|xi-xj|+|yi-yj|



输入：



输入第一行为n，表示村庄的数量



接下来n行每行有两个整数，表示一个村庄的坐标



输出：



输出一个数字，表示建立的邮局到各个村庄的和



Sample Input：



3



0 0



10 10



0 10



Sample Output：



20



提示：



村庄和邮局的坐标都一定为整数



对于超过int的数字，请用long long，输入和读取用 lld

-On a plane there are n (1 < = n < = 100000) villages, each village by the coordinates (xi, yi) labeling position,-10 ^ 9 < = xi, yi < = 10 ^ 9. Now we want to build a post office, so get the distance of the villages and the shortest. In this problem, the distance is defined as the Manhattan distance, the distance point i and the point j is equal to | xi-xj |+ | yi-yj | Entry: the first acts of n, n represents the number of villages in the next row per line Two integer that represents a village coordinates output: a number that represents the establishment of post offices to various villages and Sample Input: 3 0 0 10 10 0 10 Sample Output: 20 Tips: village post office and coordinate all necessarily integer for over int numbers, please use long long, input and reading　lld