#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.141592653589793;
vector<pair<pair<int, int>, int> > vec;
long double angl(pair<pair<int, int>, int> a) {
  long double d = atan2(a.first.second, a.first.first);
  if (d < 0) d = pi * 2 + d;
  return d * 180 / pi;
}
bool comp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  return angl(a) < angl(b);
}
long double angle(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  long double d1 = angl(a), d2 = angl(b);
  return min(abs(d1 - d2), 360 - abs(d1 - d2));
}
int main() {
  int n, a, b;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d %d", &a, &b);
    vec.push_back(make_pair(make_pair(a, b), i));
  }
  sort(vec.begin(), vec.end(), comp);
  long double ang = angle(vec[0], vec[1]);
  int s = vec[0].second, e = vec[1].second;
  for (int i = 2; i < n; i++) {
    if (ang - angle(vec[i], vec[i - 1]) > 0.000000000000001) {
      ang = angle(vec[i], vec[i - 1]);
      s = vec[i].second;
      e = vec[i - 1].second;
    }
  }
  if (angle(vec[0], vec[n - 1]) < ang) {
    s = vec[0].second;
    e = vec[n - 1].second;
  }
  printf("%d %d\n", s, e);
  return 0;
}
