#include <bits/stdc++.h>
using namespace std;
int n, x, y, flag = 100010;
long double mina = 10.0;
pair<long double, int> angle[100010];
const long double pi = 4.0 * atan(1.0);
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x, &y);
    if (y >= 0)
      angle[i].first = acos(x / (long double)sqrt(1.0 * x * x + 1.0 * y * y));
    else
      angle[i].first =
          2 * pi - acos(x / (long double)sqrt(1.0 * x * x + 1.0 * y * y));
    angle[i].second = i + 1;
  }
  sort(angle, angle + n);
  for (int i = 1; i < n; i++)
    mina = mina <= (angle[i].first - angle[i - 1].first)
               ? mina
               : (angle[flag = i].first - angle[i - 1].first);
  mina = mina <= (2 * pi - angle[n - 1].first + angle[0].first)
             ? mina
             : (2 * pi - angle[n - 1].first + angle[flag = 0].first);
  if (flag)
    printf("%d %d\n", angle[flag].second, angle[flag - 1].second);
  else
    printf("%d %d\n", angle[0].second, angle[n - 1].second);
}
