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:
/*
 * Code Author: Akshay Miterani
 * DA-IICT
 */
import java.io.*;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.*;


public class Points {

	static double eps=(double)1e-6;
	static long mod=(int)1e9+7;
	public static void main(String args[]){
		InputReader in = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		//----------My Code----------
		int n=in.nextInt();
        Point p[]=new Point[n];
        for(int i=0;i<n;i++)
            p[i]=new Point(in.nextInt(), in.nextInt(), i+1);
        Arrays.sort(p);
        
        //	Explanation:
        //	x.y=|x||y|sin(theta)
        //		----------------
        //			|x||y|
        //
        
        BigInteger resNum=null, resDen=null;
        int i1=-1, i2=-1;
        for(int i=0;i<n;i++)
        {
            Point p1=p[i];
            Point p2=p[(i+1)%n];
            long num=p2.inner(p1);
            BigInteger curNum=BigInteger.valueOf(Long.signum(num)*num*num);
            BigInteger curDen=BigInteger.valueOf(p1.inner(p1)*p2.inner(p2));
            if(curDen.compareTo(BigInteger.ZERO)<0)
            {
                curNum=curNum.negate();
                curDen=curDen.negate();
            }
            if(resNum==null || resNum.multiply(curDen).compareTo(curNum.multiply(resDen))<0)
            {
                resNum=curNum;
                resDen=curDen;
                i1=p1.id;
                i2=p2.id;
            }
        }
        out.println(i1+" "+i2);
		out.close();
		//---------------The End------------------

	}

	static class Point implements Comparable<Point>
    {
        long x,y;
        int id;
        Point(long x, long y, int id)
        {
            this.x=x;
            this.y=y;
            this.id=id;
        }

        long inner(Point p)
        {
            return x*p.x+y*p.y;
        }
        long cross(Point p)
        {
            return x*p.y - y*p.x;
        }
        int getSide()
        {
            return (y>0 || (y==0 && x>0))?-1:1;
        }
        public int compareTo(Point point)
        {
            int side1=getSide();
            int side2=point.getSide();
            if(side1!=side2)
                return side1-side2;
            return Long.signum(point.cross(this));
        }
        public String toString()
        {
            return "("+x+","+y+")";
        }
    }
	static long modulo(long a,long b,long c) {
		long x=1;
		long y=a;
		while(b > 0){
			if(b%2 == 1){
				x=(x*y)%c;
			}
			y = (y*y)%c; // squaring the base
			b /= 2;
		}
		return  x%c;
	}
	static long gcd(long x, long y)
	{
		if(x==0)
			return y;
		if(y==0)
			return x;
		long r=0, a, b;
		a = (x > y) ? x : y; // a is greater number
		b = (x < y) ? x : y; // b is smaller number
		r = b;
		while(a % b != 0)
		{
			r = a % b;
			a = b;
			b = r;
		}
		return r;
	}
	static class Pair implements Comparable<Pair>{
		long x;
		long y;
		int i;
		Pair(long xx,long yy){
			x=xx;
			y=yy;
		}
		@Override
		public int compareTo(Pair o) {
			if(this.y>=o.y)
				return 1;
			else
				return 0;

		}
	}

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

		public InputReader(InputStream inputstream) {
			reader = new BufferedReader(new InputStreamReader(inputstream));
			tokenizer = null;
		}

		public String nextLine(){
			String fullLine=null;
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					fullLine=reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return fullLine;
			}
			return fullLine;
		}
		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 long nextLong() {
			return Long.parseLong(next());
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
	}
}