#include <bits/stdc++.h>
using namespace std;
pair<long double, int> ar[100005];
bool cmp(pair<long double, int> i, pair<long double, int> j) {
  return i.first < j.first;
}
int main() {
  int i, j, k;
  int n;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &j);
    scanf("%d", &k);
    long double ang = (atan2(k, j) * 180.0) / 3.1415926535897931;
    ar[i].first = ang;
    ar[i].second = i + 1;
  }
  sort(ar, ar + n, cmp);
  long double ans = 360.0;
  int p1 = 0, p2 = 1;
  for (i = 1; i < n; i++) {
    if (ar[i].first - ar[i - 1].first < ans) {
      ans = ar[i].first - ar[i - 1].first;
      p1 = ar[i].second;
      p2 = ar[i - 1].second;
    }
  }
  if (ans > 360.0 - (ar[n - 1].first - ar[0].first)) {
    ans = 2.0 * 3.1415926535897931 - (ar[n - 1].first - ar[0].first);
    p1 = ar[0].second;
    p2 = ar[n - 1].second;
  }
  printf("%d %d\n", p1, p2);
  return 0;
}
