#include <bits/stdc++.h>
using namespace std;
int x[100010], y[100010];
const long double PI = acos(-1);
struct vectors {
  int pos;
  long double hu;
  vectors(int a, double b) {
    pos = a;
    hu = b;
  }
  vectors() {}
  friend bool operator<(vectors a, vectors b) { return a.hu < b.hu; }
};
vector<vectors> num;
int main() {
  int n;
  long double use;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x[i], &y[i]);
    use = atan2(y[i], x[i]);
    num.push_back(vectors(i, use));
  }
  sort(num.begin(), num.end());
  int s = num.size();
  int a = num[0].pos + 1, b = num[1].pos + 1;
  long double p = num[1].hu - num[0].hu;
  for (int i = 2; i < s; i++) {
    if (num[i].hu - num[i - 1].hu - p < 0) {
      a = num[i].pos + 1;
      b = num[i - 1].pos + 1;
      p = num[i].hu - num[i - 1].hu;
    }
  }
  if (2 * PI - num[s - 1].hu + num[0].hu - p < 0) {
    a = num[s - 1].pos + 1;
    b = num[0].pos + 1;
  }
  cout << a << ' ' << b << endl;
  return 0;
}
