#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 1;
const int INF = 99999;
long double PI = 3.14159265359;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  while (cin >> n) {
    pair<long double, int> a[MAX];
    for (int i = 0; i < n; i++) {
      int x, y;
      cin >> x >> y;
      long double arc = atan2(y, x);
      if (arc < 0) arc += 2 * PI;
      a[i] = {arc, i};
    }
    long double kam = INF;
    int kam_i;
    sort(a, a + n);
    a[n++] = {a[0].first + 2 * PI, a[0].second};
    for (int i = 0; i < n - 1; i++)
      if (a[i + 1].first - a[i].first < kam) {
        kam = a[i + 1].first - a[i].first;
        kam_i = i;
      }
    cout << a[kam_i].second + 1 << ' ' << a[(kam_i + 1) % n].second + 1 << "\n";
  }
}
