Problem: You are given the set of vectors on the plane, each of them starting at the origin. Your task is to find a pair of vectors with the minimal non-oriented angle between them.

Non-oriented angle is non-negative value, minimal between clockwise and counterclockwise direction angles. Non-oriented angle is always between 0 and π. For example, opposite directions vectors have angle equals to π.

Input

First line of the input contains a single integer n (2 ≤ n ≤ 100 000) — the number of vectors.

The i-th of the following n lines contains two integers xi and yi (|x|, |y| ≤ 10 000, x2 + y2 > 0) — the coordinates of the i-th vector. Vectors are numbered from 1 to n in order of appearing in the input. It is guaranteed that no two vectors in the input share the same direction (but they still can have opposite directions).

Output

Print two integer numbers a and b (a ≠ b) — a pair of indices of vectors with the minimal non-oriented angle. You can print the numbers in any order. If there are many possible answers, print any.

Examples

Input

4
-1 0
0 -1
1 0
1 1


Output

3 4


Input

6
-1 0
0 -1
1 0
1 1
-4 -5
-4 -6


Output

6 5

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author byildiz
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public boolean compareAngle(TaskC.Vector v1, TaskC.Vector v2, TaskC.Vector v3, TaskC.Vector v4, PrintWriter out) {
            long n1 = v2.y * v1.x - v2.x * v1.y;
            long n2 = v4.y * v3.x - v4.x * v3.y;
            long d1 = v1.x * v2.x + v1.y * v2.y;
            long d2 = v3.x * v4.x + v3.y * v4.y;
//        out.println(n1 + "/" + d1 + ", " + n2 + "/" + d2);
            boolean cmp = n1 * d2 < n2 * d1;
            int q1;
            if (n1 >= 0) {
                q1 = d1 >= 0 ? 0 : 1;
            } else {
                q1 = d1 >= 0 ? 3 : 2;
            }
            int q2;
            if (n2 >= 0) {
                q2 = d2 >= 0 ? 0 : 1;
            } else {
                q2 = d2 >= 0 ? 3 : 2;
            }
            if (q1 != q2) {
                return q1 < q2;
            }
            return cmp;
//        if (d1 < 0) {
//            return d2 < 0 ? cmp : !cmp;
//        } else {
//            return d2 < 0 ? !cmp : cmp;
//        }
        }

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            TaskC.Vector[] v = new TaskC.Vector[n];
            for (int i = 0; i < n; ++i) {
                int x = in.nextInt();
                int y = in.nextInt();
                v[i] = new TaskC.Vector(i + 1, x, y);
            }
            Arrays.sort(v, (o1, o2) -> {
                if (o1.q != o2.q) {
                    return o1.q - o2.q;
                }
                return o1.y * o2.x - o1.x * o2.y;
            });
            int ii = 0;
            int jj = 1;
            for (int i = 0; i < n; ++i) {
                int j = (i + 1) % n;
                if (compareAngle(v[i], v[j], v[ii], v[jj], out)) {
                    ii = i;
                    jj = j;
                }
            }
//        out.println(Arrays.toString(v));
            out.println(v[ii].id + " " + v[jj].id);
        }

        static class Vector {
            int id;
            int x;
            int y;
            int q;

            public Vector(int id, int x, int y) {
                this.id = id;
                this.x = x;
                this.y = y;
                if (y >= 0) {
                    this.q = x >= 0 ? 0 : 1;
                } else {
                    this.q = x >= 0 ? 3 : 2;
                }
            }


            public String toString() {
                return this.id + " - " + (Math.atan2(this.y, this.x) * 180 / Math.PI) + " - (" + this.x + "," + this.y + ")";
            }

        }

    }
}