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.*;
import java.math.*;
import java.util.*;

/**
 *
 * @author Saju
 *
 */

public class Main {

    private static int dx[] = { 1, 0, -1, 0 };
    private static int dy[] = { 0, -1, 0, 1 };

    private static final long INF = Long.MAX_VALUE;
    private static final int INT_INF = Integer.MAX_VALUE;
    private static final long NEG_INF = Long.MIN_VALUE;
    private static final int NEG_INT_INF = Integer.MIN_VALUE;
    private static final double EPSILON = 1e-10;

    private static final long MAX = (long) 1e12;
    
    private static final long MOD = 100000007;

    private static final int MAXN = 300005;
    private static final int MAXA = 100007;
    private static final int MAXLOG = 22;
    private static final double PI = Math.acos(-1);
    
	public static void main(String[] args) throws IOException {

		InputReader in = new InputReader(System.in);
//		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

//         InputReader in = new InputReader(new FileInputStream("src/test.in"));
//         PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("src/test.out")));

		
		
/*




*/		
	
		
		int n = in.nextInt();
		List<Point> list = new ArrayList<>();
		for(int i = 0; i < n; i++) {
			long x = in.nextLong();
			long y = in.nextLong();
			Point p = new Point(i + 1, x, y);
			list.add(p);
		}
		
		Collections.sort(list);
		
		int id1 = 0;
		int id2 = 0;
		NumDen max = null;
		for(int i = 0; i < n; i++) {
			Point p1 = list.get(i);
			Point p2 = list.get((i + 1) % n);
			NumDen numden = new NumDen(p1, p2);
			
			if(max == null) {
				max = numden;
				id1 = p1.id;
				id2 = p2.id;
			}
			else if(max.compareTo(numden) >= 1) {
				max = numden;
				id1 = p1.id;
				id2 = p2.id;
			}
			
		}
		
		out.println(id1 + " " + id2);
		
		in.close();
		out.flush();
		out.close();
		System.exit(0);
	}
	
	private static class NumDen implements Comparable<NumDen>{
		Point a;
		Point b;
		long val;
		BigInteger num;
		BigInteger den;
		NumDen(Point a, Point b){
			this.a = a;
			this.b = b;
			val = (long) ((a.x * b.x) + (a.y * b.y));
			num = new BigInteger(Long.toString(val * val));
			BigInteger modA = new BigInteger((new Long(a.x * a.x + a.y * a.y)).toString());
			BigInteger modB = new BigInteger((new Long(b.x * b.x + b.y * b.y)).toString());
			den = modA.multiply(modB);
		}
		@Override
		public int compareTo(NumDen o) {
			if(val == 0 && o.val == 0) {
				return 0;
			}
			if(val == 0) {
				if(o.val > 0) {
					return 1;
				}
				return -1;
			}
			if(o.val == 0) {
				if(val > 0) {
					return -1;
				}
				return 1;
			}
			
			if(val > 0) {
				if(o.val > 0) {
					int k = (num.multiply(o.den)).compareTo(o.num.multiply(den));
					return -k;
				}
				return -1;
			}
			else {
				if(o.val > 0) {
					return 1;
				}
				int k = (num.multiply(o.den)).compareTo(o.num.multiply(den));
				return k;
			}
		}
	}
	

	private static double cross(Point a, Point b) {
		double val = (a.x * b.y) - (a.y * b.x);
		return val;
	}


	private static class Point implements Comparable<Point>{
		long x;
		long y;
		int id;
		Point(int id, long x, long y){
			this.id = id;
			this.x = x;
			this.y = y;
		}
		private Point rotate90ClockWise(Point p) {
			return new Point(p.id, p.y, -p.x);
		}

		private int q(Point p) {
			
			if(p.x == 0) {
				if(p.y > 0) {
					return 2;
				}
				return 4;
			}
			if(p.y == 0) {
				if(p.x > 0) {
					return 1;
				}
				return 3;
			}
			
			if(p.x > 0) {
				if(p.y > 0) {
					return 1;
				}
				else {
					return 4;
				}
			}
			else {
				if(p.y > 0) {
					return 2;
				}
				else {
					return 3;
				}
			}
		}
		@Override
		public int compareTo(Point p2) {
			Point p1 = this;
			int qp1 = q(p1);
			int qp2 = q(p2);
			if(qp1 != qp2) {
				return qp1 - qp2;
			}
			
			if(qp1 == 1) {
				double cross = cross(p2, p1);
				if(cross > 0.0) {
					return 1;
				}
				else {
					return -1;
				}
			}
			 return rotate90ClockWise(p1).compareTo(rotate90ClockWise(p2));
		}
	}
	
	/*
	 * return the number of elements in list that are less than or equal to the val
	 */
	private static long upperBound(List<Long> list, long val) {
		int start = 0;
		int len = list.size();
		int end = len - 1;
		int mid = 0;

		while (true) {
			if (start > end) {
				break;
			}
			mid = (start + end) / 2;
			long v = list.get(mid);
			if (v == val) {
				start = mid;
				while(start < end) {
					mid = (start + end) / 2;
					if(list.get(mid) == val) {
						if(mid + 1 < len && list.get(mid + 1) == val) {
							start = mid + 1;
						}
						else {
							return mid + 1;
						}
					}
					else {
						end = mid - 1;
					}
				}
				return start + 1;
			}
			if (v > val) {
				end = mid - 1;
			} else {
				start = mid + 1;
			}
		}
		if (list.get(mid) < val) {
			return mid + 1;
		}
		return mid;
	}


	private static boolean isPalindrome(String str) {
		StringBuilder sb = new StringBuilder();
		sb.append(str);
		String str1 = sb.reverse().toString();
		return str.equals(str1);
	}

	private static String getBinaryStr(long n, int j) {
		String str = Long.toBinaryString(n);
		int k = str.length();
		for (int i = 1; i <= j - k; i++) {
			str = "0" + str;
		}

		return str;
	}
	
	private static long modInverse(long r) {
		return bigMod(r, MOD - 2, MOD);
	}
	
	private static long bigMod(long n, long k, long m) {

        long ans = 1;
        while (k > 0) {
            if ((k & 1) == 1) {
                ans = (ans * n) % m;
            }
            n = (n * n) % m;
            k >>= 1;
        }
        return ans;
    }
    
	private static long ceil(long n, long x) {
		long div = n / x;
        if(div * x != n) {
            div++;
        }
        return div;
	}
	
    private static int ceil(int n, int x) {
        int div = n / x;
        if(div * x != n) {
            div++;
        }
        return div;
    }

    
    private static int abs(int x) {
        if (x < 0) {
            return -x;
        }
        return x;
    }
    
    private static double abs(double x) {
        if (x < 0) {
            return -x;
        }
        return x;
    }

    private static long abs(long x) {
        if(x < 0) {
            return -x;
        }
        return x;
    }

    private static int lcm(int a, int b) {
        return (a * b) / gcd(a, b);
    }

    private static int gcd(int a, int b) {
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }
    
    private static long gcd(long a, long b) {
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }

    private static int log(long x, int base) {
        return (int) (Math.log(x) / Math.log(base));
    }

    private static long min(long a, long b) {
        if (a < b) {
            return a;
        }
        return b;
    }

    private static int min(int a, int b) {
        if (a < b) {
            return a;
        }
        return b;
    }

    private static long max(long a, long b) {
        if (a < b) {
            return b;
        }
        return a;
    }

    private static int max(int a, int b) {
        if (a < b) {
            return b;
        }
        return a;
    }

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

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

        public String next() {
            try {
                while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                    tokenizer = new StringTokenizer(reader.readLine());

                }
            } catch (IOException e) {
                return null;
            }
            return tokenizer.nextToken();
        }

        public String nextLine() {
            String line = null;
            try {
                tokenizer = null;
                line = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            return line;
        }

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

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public boolean hasNext() {
            try {
                while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                    tokenizer = new StringTokenizer(reader.readLine());
                }
            } catch (Exception e) {
                return false;
            }
            return true;
        }
        
        public int[] nextIntArr(int n) {
        	int arr[] = new int[n];
    		for(int i = 0; i < n; i++) {
    			arr[i] = nextInt();
    		}
    		return arr;
        }
        
        public long[] nextLongArr(int n) {
        	long arr[] = new long[n];
    		for(int i = 0; i < n; i++) {
    			arr[i] = nextLong();
    		}
    		return arr;
        }
        
        public int[] nextIntArr1(int n) {
        	int arr[] = new int[n + 1];
    		for(int i = 1; i <= n; i++) {
    			arr[i] = nextInt();
    		}
    		return arr;
        }
        
        public long[] nextLongArr1(int n) {
        	long arr[] = new long[n + 1];
    		for(int i = 1; i <= n; i++) {
    			arr[i] = nextLong();
    		}
    		return arr;
        }
       
        public void close() {
        	try {
        		if(reader != null) {
        			reader.close();
        		}
        	}
        	catch(Exception e) {
        		
        	}
        	
        	
        }
    }

}