You are given a set of *n* vectors on a plane. For each vector you are allowed to multiply any of its coordinates by -1. Thus, each vector *v*<sub class="lower-index">*i*</sub> = (*x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>) can be transformed into one of the following four vectors:
 -  *v*<sub class="lower-index">*i*</sub><sup class="upper-index">1</sup> = (*x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>), -  *v*<sub class="lower-index">*i*</sub><sup class="upper-index">2</sup> = ( - *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>), -  *v*<sub class="lower-index">*i*</sub><sup class="upper-index">3</sup> = (*x*<sub class="lower-index">*i*</sub>,  - *y*<sub class="lower-index">*i*</sub>), -  *v*<sub class="lower-index">*i*</sub><sup class="upper-index">4</sup> = ( - *x*<sub class="lower-index">*i*</sub>,  - *y*<sub class="lower-index">*i*</sub>). 
You should find two vectors from the set and determine which of their coordinates should be multiplied by -1 so that the absolute value of the sum of the resulting vectors was minimally possible. More formally, you should choose two vectors *v*<sub class="lower-index">*i*</sub>, *v*<sub class="lower-index">*j*</sub> (1 ≤ *i*, *j* ≤ *n*, *i* ≠ *j*) and two numbers *k*<sub class="lower-index">1</sub>, *k*<sub class="lower-index">2</sub> (1 ≤ *k*<sub class="lower-index">1</sub>, *k*<sub class="lower-index">2</sub> ≤ 4), so that the value of the expression |*v*<sub class="lower-index">*i*</sub><sup class="upper-index">*k*<sub class="lower-index">1</sub></sup> + *v*<sub class="lower-index">*j*</sub><sup class="upper-index">*k*<sub class="lower-index">2</sub></sup>| were minimum.
The first line contains a single integer *n* (2 ≤ *n* ≤ 10<sup class="upper-index">5</sup>). Then *n* lines contain vectors as pairs of integers "*x*<sub class="lower-index">*i*</sub> *y*<sub class="lower-index">*i*</sub>" ( - 10000 ≤ *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> ≤ 10000), one pair per line.
5
-7 -3
9 0
-8 6
7 -8
4 -5
3 2 4 2
5
3 2
-4 7
-6 0
-8 4
5 1
3 4 5 4
2
-4 -2
-2 1
1 4 2 3
3
-4 -3
-4 -5
-1 0
2 4 1 1
10
53 86
-48 72
-74 48
75 -91
-31 14
13 67
24 -55
-76 -67
86 5
-84 94
10 2 4 2
10
-65 29
77 29
74 -54
-79 -65
43 46
-12 -92
9 88
28 6
-63 49
-37 17
6 4 7 4
10
-58 72
76 -39
-28 19
93 10
-84 -97
88 99
69 30
-43 53
65 67
-15 -60
6 1 5 1
10
75 15
0 69
-6 -83
-86 61
91 87
87 -60
3 -78
61 -75
17 60
-67 14
6 3 4 3
'''
modulo |v| = sqrt(xˆ2 + yˆ2)

|v_1 + v_2| = sqrt((x_1 + x_2)ˆ2 + (y_1 + y_2)ˆ2)
'''

def valor(v, tipo):
    x = [0,0]
    if(tipo==1):
        x = v
    if(tipo==2):
        x[0] = -v[0]
        x[1] = v[1]
    if(tipo==3):
        x[1] = -v[1]
        x[0] = v[0]
    if(tipo==4):
        x[0] = -v[0]
        x[1] = -v[1]
    return x

def modulo(v1, v2):
    return ((v1[0]+v2[0])**2 + (v1[1]+v2[1])**2)


def min(v1, v2):
    minimo = modulo(v1, v2)
    vm = [1, 1]
    for k in range(4):
        for l in range(4):
            v1t = valor(v1, k+1)
            v2t = valor(v2, l+1)
            aux = modulo(v1t, v2t)
            #print("minimo ", k+1, l+1, aux)
            if( aux < minimo):
                minimo = aux
                vm = [k+1, l+1]
    return vm


n = int(input())
v = []



for i in range(n):
    vi = input().split()
    vi[0] = int(vi[0])
    vi[1] = int(vi[1])
    v.append([vi[0], vi[1]])


tm = min(v[0], v[1])
vm = [0,1]
minimo = modulo(valor(v[0], tm[0]), valor(v[1], tm[1]))


for i in range(n):
    #print(i)
    for j in range(i+1, n):
        tmi = min(v[i],v[j])
        m = modulo(valor(v[i], tmi[0]), valor(v[j], tmi[1]))
        #print(tm, minimo, i, j, tmi, m)
        if(m < minimo):
            tm = tmi
            minimo = m
            vm = [i, j]

print(vm[0]+1, tm[0], vm[1]+1, tm[1])

#print(encontrarMinimo(v))














		  	 								 			 		  	  		  	