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.io.IOException;
import java.io.InputStreamReader;
import java.util.List;
import java.util.StringTokenizer;
import java.math.BigInteger;
import java.io.BufferedReader;
import java.util.LinkedList;
import java.util.Comparator;
import java.util.Collections;
import java.io.InputStream;

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

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            List<Vector> list = new LinkedList<>();

            if (n == 2) {
                out.println("1 2");
                return;
            }

            for (int i = 0; i < n; i++)
                list.add(new Vector(in.nextInt(), in.nextInt(), i));

        /*Collections.sort(list, new Comparator<Vector>() {
            @Override
            public int compare(Vector o1, Vector o2) {
                return o1.x * o2.y - o1.y * o2.x < 0 ? 1 : -1;
            }
        });*/

            Collections.sort(list, new Comparator<Vector>() {

                public int compare(Vector o1, Vector o2) {
                    return Math.atan2(o1.x, o1.y) > Math.atan2(o2.x, o2.y) ? -1 : 1;
                }
            });

            Vector[] arr = list.toArray(new Vector[0]);

            Vector u = arr[0];
            Vector v = arr[1];

            int ansi = u.id + 1, ansj = v.id + 1;

            long sc = u.x * v.x + u.y * v.y;
            long cSign = sc > 0 ? 1 : -1;
            long ust = sc * sc;
            long ast = (u.x * u.x + u.y * u.y) * 1L * (v.x * v.x + v.y * v.y);

            long bestA = ust;
            long bestB = ast;
            long bSign = cSign;

            for (int i = 0; i < n; i++) {
                int j = (i + 1) % n;
                u = arr[i];
                v = arr[j];

                sc = u.x * v.x + u.y * v.y;
                cSign = sc > 0 ? 1 : -1;
                ust = sc * sc;
                ast = (u.x * u.x + u.y * u.y) * 1L * (v.x * v.x + v.y * v.y);

                //boolean isLess = bestA * ast < ust * bestB;
                boolean isLess = less(bestA, ast, ust, bestB);


                if ((cSign == 1 && bSign == -1) || (cSign == 1 && bSign == 1 && isLess) || (cSign == -1 && bSign == -1 && !isLess)) {
                    if (sc > 0) bSign = 1;
                    bestA = ust;
                    bestB = ast;
                    ansi = arr[i].id + 1;
                    ansj = arr[j].id + 1;
                }
            }

            out.println(ansi + " " + ansj);
        }

        boolean less(long a, long b, long c, long d) {
            BigInteger r1 = new BigInteger(a + "").multiply(new BigInteger(b + ""));
            BigInteger r2 = new BigInteger(c + "").multiply(new BigInteger(d + ""));
            return r1.compareTo(r2) < 0;


        }

        public class Vector {
            int x;
            int y;
            int id;

            public Vector(int x, int y, int id) {
                this.x = x;
                this.y = y;
                this.id = id;
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}