#include <bits/stdc++.h>
using namespace std;
int n, x, y, p[131072], ans;
long double d[131072], opt;
bool cmp(int x, int y) { return d[x] < d[y]; }
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &x, &y);
    d[i] = atan2(y, x);
    p[i] = i;
  }
  sort(p, p + n, cmp);
  ans = n - 1;
  opt = d[p[0]] - d[p[n - 1]] + asin(1.) * 4;
  for (int i = 0; i + 1 < n; ++i)
    if (d[p[i + 1]] - d[p[i]] < opt) {
      opt = d[p[i + 1]] - d[p[i]];
      ans = i;
    }
  printf("%d %d\n", p[ans] + 1, p[(ans + 1) % n] + 1);
  return 0;
}
