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.util.*;
//import java.lang.*;
import java.io.*;
//import java.math.*;
//import java.awt.*;

public class Test1
{
            static class Newpoint 
           { public final long x;
             public final long y;
           
           public Newpoint (long x, long y)
           { this.x=x;
           this.y =y;
          }
          } 
               
        public static long cross(Newpoint a, Newpoint b)
    { return (a.x*b.y-a.y*b.x);
    }
    
        public static long dot(Newpoint a, Newpoint b)
    { return (a.x*b.x+a.y*b.y);
    }
        
    public static boolean angleless(Newpoint a1, Newpoint b1, Newpoint a2, Newpoint b2)
    {Newpoint p1 = new Newpoint (dot(a1,b1), Math.abs(cross(a1,b1)));
     Newpoint p2 = new Newpoint (dot(a2,b2), Math.abs(cross(a2,b2)));
     return (cross(p1,p2)>0);
    }       
    
                static class Pair implements Comparable<Pair> {
    public final int index;
    public final Newpoint p;
    
       
    public Pair(int index, long x, long y) {
        this.index = index;
        p = new Newpoint(x,y);
                }
    

    @Override
    public int compareTo(Pair other) {
        if (p.x<0 && p.y==0 && !(other.p.x<0 && other.p.y==0)) return 1;
        if (other.p.x<0 && other.p.y==0 && !(p.x<0 && p.y==0)) return -1;
        if (p.y>0 && other.p.y <= 0) return 1;
        if (p.y<=0 && other.p.y > 0) return -1;
         
        if (cross(this.p, other.p)>0) return -1;
        if (cross(this.p, other.p)<0) return 1;
        else return 0;
    }
}
    
            public static void main (String[] args) throws java.lang.Exception
	{
            /*Newpoint a1 = new Newpoint(10,10);
              Newpoint b1 =      new Newpoint(6,8);
                Newpoint a2 =            new Newpoint(-8,10);
                   Newpoint b2 =                 new Newpoint(-5,6);
                   System.out.println("a1 dot b1 = " + dot(a1,b1));
                   System.out.println("a2 dot b2 = " + dot(a2,b2));
                   Newpoint p1 = new Newpoint (dot(a1,b1), Math.abs(cross(a1,b1)));
     Newpoint p2 = new Newpoint (dot(a2,b2), Math.abs(cross(a2,b2)));
     System.out.println(p1.x+" "+p1.y);
     System.out.println(p2.x+" "+p2.y);
     System.out.println(cross(p1,p2));
            System.out.println(angleless(a1,b1,a2,b2));*/
               
        Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int n = in.nextInt();
        Pair[] vektory;
        vektory = new Pair[n];
        
        for (int i = 0;i<n; i++)
        {
            int x = in.nextInt();
            int y = in.nextInt();  
            vektory[i] = new Pair(i+1, x,y);
        }
              
	    Arrays.sort(vektory);
            /*for(int i=1;i<n;i++)
            {System.out.print("Vector " + vektory[i].index + ". Coordinates: "+ vektory[i].p.x+" ");
             System.out.println(vektory[i].p.y);
            }*/
  
	    int smallest = 0;           
	    
	    for (int i = 1; i <n ; i++)
	    {
	        if (angleless(vektory[(i+1)%n].p,vektory[i].p,vektory[smallest].p,vektory[smallest+1].p))
                {
                smallest = i;
                                }
                //System.out.println(smallest);
	    }

System.out.println(vektory[smallest].index);
System.out.println(vektory[(smallest+1)%n].index);
	    
	}
}