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
import numpy as np

def calc(x1, x2):
    if x1[0] == x2[0] and x1[1] == x2[1]:
        return 1
    elif x1[0] != x2[0] and x1[1] == x2[1]:
        return 2
    elif x1[0] == x2[0] and x1[1] != x2[1]:
        return 3
    elif x1[0] != x2[0] and x1[1] != x2[1]:
        return 4

inputfile = open("input.txt", "r")
output = open("output.txt", "w")
X = []
Y = []
n = int(inputfile.readline())
I = 0
J = 0
k1 = 0
k2 = 0
for i in range(n):
    x, y = inputfile.readline().split(" ")
    X.append(int(x))
    Y.append(int(y))
X1 = [(i if i>0 else -i) for i in X]
Y1 = [(i if i>0 else -i) for i in Y]
d = np.Inf
for j in range(1, n):
    for i in range(0, j):
        if ((X1[i]-X1[j])**2 + (Y1[i]-Y1[j])**2)**0.5 < d:
            I = i
            J = j
k1 = calc([X[i], Y[i]], [X1[i], Y1[i]])
k2 = calc([X[j], Y[j]], [X1[j], Y1[j]])

output.write(str(i)+" "+str(k1)+" "+str(j)+" "+str(k2))

inputfile.close()
output.close()