#include <bits/stdc++.h>
using namespace std;
const long double pi = 2 * acos(0);
const int N = 111111;
const int MOD = 1e9 + 7;
int n;
int x, y;
pair<long double, int> a[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long double best = 181;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> x >> y;
    a[i] = make_pair(atan2(x, y) * 180 / pi, i + 1);
  }
  sort(a, a + n);
  int id1 = a[0].second, id2 = a[1].second;
  for (int i = 1; i < n; ++i)
    if (best > a[i].first - a[i - 1].first) {
      best = a[i].first - a[i - 1].first;
      id1 = a[i].second;
      id2 = a[i - 1].second;
    }
  if (best > (360 - a[n - 1].first + a[0].first))
    return cout << a[0].second << " " << a[n - 1].second, 0;
  cout << id1 << " " << id2;
}
