import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from random import randrange

def binary_search(l, r, minimize):
    if minimize: l -= 1
    else: r += 1
    while l+1 < r:
        m = (l+r)//2
        if ok(m) ^ minimize: l = m
        else: r = m
    if minimize: return r
    return l

def ok(m):
    cnt=0
    for x,y in xy:
        if a*x+b*y<m:cnt+=1
        if cnt==n:return True
    return False

def online(c):
    for x,y in xy:
        if a*x+b*y+c==0:return True
    return False

mx=10**5
n=II()
xy=LLI(2*n)

while 1:
    a,b=randrange(mx+1),randrange(mx+1)
    if a==0 and b==0:continue
    c=binary_search(-2*10**9,2*10**9,True)
    if not online(c):
        print(a,b,-c)
        # for x,y in xy:
        #     print(a*x+b*y)
        break