#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN(100005);
int n;
pair<long double, int> a[MAXN];
long double angle(int i) {
  long double d = abs(a[(i + 1) % n].first - a[i].first);
  d = min(d, 4 * acos(0) - d);
  return d;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    a[i] = make_pair(atan2(y, x), i + 1);
  }
  sort(a, a + n);
  int pos = 0;
  for (int i = 1; i <= n - 1; i++) {
    if (angle(i) < angle(pos)) pos = i;
  }
  printf("%d %d", a[pos].second, a[(pos + 1) % n].second);
}
