The Galaxy contains *n* planets, there are many different living creatures inhabiting each planet. And each creature can get into troubles! Space rescuers know it perfectly well and they are always ready to help anyone who really needs help. All you need to do is call for them. 

Now the space rescuers plan to build the largest in the history of the Galaxy rescue station; however, the rescue station's location is yet to be determined. As some cases are real emergencies, the rescuers want to find such a point in the Galaxy from which it would be possible to get to the remotest planet in the minimum possible time. In other words, the rescuers need such point in the space that the distance between it and the planet remotest from it was minimal (if we compare this point with all other possible points in the space). Unfortunately, the rescuers can't sole this problem.

As the planets are quite remote from each other, they can be considered as points in Euclidean three-dimensional space. The distance between points (*x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>, *z*<sub class="lower-index">*i*</sub>) and (*x*<sub class="lower-index">*j*</sub>, *y*<sub class="lower-index">*j*</sub>, *z*<sub class="lower-index">*j*</sub>) can be calculated by the formula <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/57a5138d10d34cd52c686032cd09167bffef7afe.png" style="max-width: 100.0%;max-height: 100.0%;"/>. The rescue station can be positioned in any point in the space. It can also coincide with some planet. 

Galaxy is in danger! Save the space rescuers and find the required point for them.
The first line of the input file contains integer *n* — the number of planets (1 ≤ *N* ≤ 100). Each of the following *n* lines contains information about the planets. The *i*-th line contains three integers *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>, *z*<sub class="lower-index">*i*</sub> — the coordinates of the *i*-th planet ( - 10<sup class="upper-index">4</sup> ≤ *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>, *z*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">4</sup>, 1 ≤ *i* ≤ *n*). No two planets coincide.
5
5 0 0
-5 0 0
0 3 4
4 -3 0
2 2 -2
-0.0000000017 -0.0000000319 0.0000000473
4
-2 -9 1
10 4 0
-1 1 0
3 -10 -4
4.0000068501 -2.5000015036 0.5000626514
5
6 0 -4
8 1 5
-8 5 -6
-2 -4 -3
8 -2 1
0.0000449540 2.9999160856 -0.5000959014
6
-1 1 -5
-1 -1 -9
5 -2 -6
4 8 2
-4 -5 8
-3 2 10
-1.6984521916 0.4352048078 0.5419726934
7
-1 4 -9
6 -5 8
1 -6 -10
-9 5 7
6 4 -6
-1 -6 2
-8 -6 4
-1.9794286570 -1.4394949979 0.2964799042
8
0 10 8
-6 8 -5
-6 3 2
9 -7 1
-5 3 -1
-1 9 8
-7 10 7
-5 9 8
0.7416514696 1.6715998752 2.8248709447
9
-1 -7 4
8 -1 -1
5 5 4
-4 6 6
-10 -10 3
-3 -8 7
5 -8 -1
0 4 3
7 2 -4
-1.5154900846 -3.2958137613 0.6695576316
10
1 8 7
0 10 3
-9 -4 7
9 0 1
10 -8 7
3 10 10
7 0 -10
5 -7 4
-5 -3 8
7 -7 8
1.8296283657 0.3157346029 1.7080583631
1
1 2 3
1.0000000050 1.9999999972 2.9999999886
1
10000 10000 10000
9999.9999999642 9999.9999999642 9999.9999999642
2
0 0 0
10 10 10
5.0000195287 5.0000055246 4.9999749492
3
-2 5 7
5 9 1
-4 6 -2
-0.0866477656 6.7666194226 1.9933238886
3
-5 -5 -5
1 1 1
5 5 5
-0.0001166594 0.0000667381 0.0000499248
4
-1 -1 -1
1 -1 1
-2 1 -3
-3 2 1
-1.0411732147 0.4451023784 -0.3715688976
4
0 1 2
0 -3 4
0 -2 -1
0 2 -1
0.0000000017 -0.5000034057 1.4999965947
4
-1 -2 -3
0 0 0
3 6 9
10 20 30
4.4997882318 8.9999640024 13.5000945803
4
10000 10000 10000
-10000 -10000 10000
-10000 10000 -10000
10000 -10000 -10000
-0.0000000017 0.0000000017 0.0000000017
8
10000 10000 10000
10000 10000 -10000
10000 -10000 10000
10000 -10000 -10000
-10000 10000 10000
-10000 10000 -10000
-10000 -10000 10000
-10000 -10000 -10000
0.0000000017 0.0000000017 0.0000000017
20
-60 50 -44
-19 -98 -35
-56 14 -81
39 -71 58
-48 -79 -62
-56 14 -26
-10 -100 84
-13 -68 -96
-50 39 -36
-78 48 -73
-52 62 72
21 65 59
26 27 82
41 -85 1
14 -61 -1
-21 90 -47
100 88 -97
75 -41 38
7 60 2
-71 -57 -90
37.6686812764 -7.9351947681 -12.9655341227
20
-9983 -1468 -7570
-5049 -6137 -3828
-7892 7849 -5065
4129 8135 8447
-2950 -7915 -8406
5062 7012 -1371
7408 8618 348
5524 -4358 5181
1426 3793 -891
-4306 654 4011
4668 350 4864
-8488 -2135 62
4016 5236 8201
3586 -7394 4239
-1477 -8231 -4024
1570 323 7190
-3508 499 -1993
-9038 1250 9631
193 5533 5534
-853 -4492 3715
-909.8740860117 269.7743663381 498.1414036099
66
2 2 3
2 2 6
2 2 9
2 2 12
2 4 3
2 4 6
2 4 9
2 4 12
2 6 3
2 6 6
2 6 9
2 6 12
2 8 3
2 8 6
2 8 9
2 8 12
4 2 3
4 2 6
4 2 9
4 2 12
4 4 3
4 4 6
4 4 9
4 4 12
4 6 3
4 6 6
4 6 9
4 6 12
4 8 3
4 8 6
4 8 9
4 8 12
6 2 3
6 2 6
6 2 9
6 2 12
6 4 3
6 4 6
6 4 9
6 4 12
6 6 3
6 6 6
6 6 9
6 6 12
6 8 3
6 8 6
6 8 9
6 8 12
8 2 3
8 2 6
8 2 9
8 2 12
8 4 3
8 4 6
8 4 9
8 4 12
8 6 3
8 6 6
8 6 9
8 6 12
8 8 3
8 8 6
8 8 9
8 8 12
10000 9658 3621
-9986 -9887 -2873
6.9989324584 -114.4983343790 373.9982724515
import math
n=int(input())
list1=[]
for i in range(n):
    x,y,z=map(int,input().split())
    list1.append([x,y,z])
d=[]
for i in range(len(list1)):
    x=list1[i][0]
    y=list1[i][1]
    z=list1[i][2]
    d.append([math.sqrt((x*x)+(y*y)+(z*z)),i])
d.sort(reverse=True)
r=d[0][1]
res=[]
remote=list1[r]
for i in range(len(remote)):
    res.append([abs(remote[i]),i])
res.sort()    

if res[0][0]!=0:

    remote[res[0][1]]-=1
if res[0][0]==0:
    if res[1][0]!=0:
        remote[res[1][1]]-=1
    if res[1][0]==0:
        remote[res[2][1]]-=1
    
for i in remote:
    print(i,end=" ")

