#include <bits/stdc++.h>
using namespace std;
pair<long double, int> a[100005];
int n, x, y;
long double PI = acos(-1.0), re;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x >> y;
    if (y < 0)
      a[i] = pair<long double, int>(atan2(y, x) + 2 * PI, i + 1);
    else
      a[i] = pair<long double, int>(atan2(y, x), i + 1);
  }
  sort(a, a + n);
  re = 1000.0;
  for (int i = 0; i < n - 1; i++) {
    if ((a[i + 1].first - a[i].first) < re)
      re = a[i + 1].first - a[i].first, x = a[i + 1].second, y = a[i].second;
  }
  if (a[0].first + 2 * PI - a[n - 1].first < re)
    x = a[0].second, y = a[n - 1].second;
  cout << x << " " << y << endl;
  return 0;
}
