문제

Fourth Great and Bountiful Human Empire is developing a transconduit tunnel network connecting all it's planets. The Empire consists of N planets, represented as points in the 3D space. The cost of forming a transconduit tunnel between planets A and B is: TunnelCost[A,B] = min{ |xA-xB|, |yA-yB|, |zA-zB| } where (xA, yA, zA) are 3D coordinates of planet A, and (xB, yB, zB) are coordinates of planet B. The Empire needs to build exactly N - 1 tunnels in order to fully connect all planets, either by direct links or by chain of links. You need to come up with the lowest possible cost of successfully completing this project.

입력

The first line of input contains one integer N (1 ≤N ≤100 000), number of planets. Next N lines contain exactly 3 integers each. All integers are between -109 and 109 inclusive. Each line contains the x, y, and z coordinate of one planet (in order). No two planets will occupy the exact same point in space.

출력

The first and only line of output should contain the minimal cost of forming the network of tunnels.

예제 입력 1

2
1 5 10
7 8 2

예제 출력 1

3

예제 입력 2

3
-1 -1 -1
5 5 5
10 10 10

예제 출력 2

11

예제 입력 3

5
11 -15 -15
14 -5 -15
-1 -1 -5
10 -4 -1
19 -4 19

예제 출력 3

4