#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1);
vector<pair<long double, long long> > a;
long double diff(long double &a, long double &b) {
  long double ans = abs(a - b);
  if (ans > 180) ans = 360 - ans;
  return ans;
}
void solve() {
  long long n;
  cin >> n;
  long double x, y;
  a.resize(n);
  for (long long i = 0; i < n; i++) {
    cin >> x >> y;
    a[i].first = atan2(y, x) * 180 / pi;
    a[i].second = i;
  }
  sort(a.begin(), a.end());
  long long l = -1, r = -1;
  long double mn = 200;
  for (long long i = 0; i < n; i++) {
    if (diff(a[i].first, a[(i + 1) % n].first) < mn) {
      mn = diff(a[i].first, a[(i + 1) % n].first);
      l = a[i].second + 1;
      r = a[(i + 1) % n].second + 1;
    }
  }
  cout << l << " " << r << '\n';
}
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  ;
  long long tests = 1;
  while (tests--) {
    solve();
  }
  return 0;
}
