B'A cubic lattice L in 3 -dimensional euclidean space is a set of points defined in the following way: L= {u cdot vec r_1 + v cdot vec r_2 + w cdot vec r_3 }_{u, v, w in mathbb Z} Where vec r_1, vec r_2, vec r_3 in mathbb{Z}^3 are some integer vectors such that: You have to find a cubic lattice L such that A subset L and r is the maximum possible. First line contains single integer n ( 1 <= q n <= q 10^4 ) -- the number of points in A . The i -th of the following n lines contains integers x_i , y_i , z_i ( 0 < x_i^2 + y_i^2 + z_i^2 <= q 10^{16} ) -- coordinates of the i -th point. It is guaranteed that gcd(g_1,g_2, ... ,g_n)=1 where g_i= gcd(x_i,y_i,z_i) . In first line output a single integer r^2 , the square of maximum possible r . In following 3 lines output coordinates of vectors vec r_1 , vec r_2 and vec r_3 respectively. If there are multiple possible answers, output any. '...