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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<pair<long long, long long>, int> > a;
bool fn(pair<pair<long long, long long>, int>& lhs,
        pair<pair<long long, long long>, int>& rhs) {
  long long x[] = {lhs.first.first, rhs.first.first};
  long long y[] = {lhs.first.second, rhs.first.second};
  long long p[2], q[2];
  for (int i = 0; i < 2; ++i) {
    p[i] = x[i] * x[i] * (x[i] < 0 ? -1 : 1);
    q[i] = x[i] * x[i] + y[i] * y[i];
    if (y[i] < 0) p[i] = -p[i] - q[i] * 2;
  }
  return p[0] * q[1] < p[1] * q[0];
}
void mult(long long p, long long q, long long res[3], int* sign) {
  *sign = (p >= 0 ? 1 : -1) * (q >= 0 ? 1 : -1);
  p *= (p < 0 ? -1 : 1);
  q *= (q < 0 ? -1 : 1);
  long long a[] = {p >> 31, q >> 31};
  long long b[] = {p & ((1LL << 31) - 1LL), q & ((1LL << 31) - 1LL)};
  res[0] = b[0] * b[1];
  res[1] = a[0] * b[1] + a[1] * b[0];
  res[2] = a[0] * a[1];
  for (int i = 0; i < 2; i++) {
    if (res[i] >= (1LL << 31)) {
      res[i + 1] += res[i] >> 31;
      res[i] &= (1LL << 31) - 1LL;
    }
  }
}
bool cmp(long long a[3], long long b[3]) {
  return a[2] != b[2] ? a[2] < b[2]
                      : (a[1] != b[1] ? a[1] < b[1] : a[0] < b[0]);
}
bool less_than(long long p0, long long q0, long long p1, long long q1) {
  int sign[2];
  long long res[2][3];
  mult(p0, q1, res[0], &sign[0]);
  mult(p1, q0, res[1], &sign[1]);
  if (sign[0] != sign[1]) return sign[0] < sign[1];
  if (sign[0] > 0) {
    return cmp(res[0], res[1]);
  } else
    return cmp(res[1], res[0]);
}
int main() {
  scanf("%d", &n);
  int x, y;
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &x, &y);
    a.push_back(make_pair(make_pair(x, y), i + 1));
  }
  sort(a.begin(), a.end(), fn);
  long long mp = -2, mq = 1;
  int ai = -1, aj = -1;
  for (int i = 0; i < n; ++i) {
    int j = (i == n - 1 ? 0 : i + 1);
    long long x[] = {a[i].first.first, a[j].first.first};
    long long y[] = {a[i].first.second, a[j].first.second};
    long long p = x[0] * x[1] + y[0] * y[1];
    p *= p * (p < 0 ? -1 : 1);
    long long q = (x[0] * x[0] + y[0] * y[0]) * (x[1] * x[1] + y[1] * y[1]);
    if (less_than(mp, mq, p, q)) {
      mp = p;
      mq = q;
      ai = a[i].second;
      aj = a[j].second;
    }
  }
  printf("%d %d\n", ai, aj);
  return 0;
}