#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  long double pi = acos(-1);
  vector<pair<long double, long long>> v(n);
  for (long long i = 0; i < n; i++) {
    long double a, b;
    cin >> a >> b;
    long double r = atan2l(b, a);
    while (r < 0) r += 2 * pi;
    v[i] = {r, i + 1};
  }
  sort(v.begin(), v.end());
  pair<long long, long long> ans = {v[0].second, v[n - 1].second};
  long double mi = v[n - 1].first - v[0].first;
  while (mi > pi) {
    mi = 2 * pi - mi;
  }
  for (long long i = 1; i < n; i++) {
    long double x = v[i].first - v[i - 1].first;
    if (x < mi) {
      mi = x;
      ans.first = v[i - 1].second;
      ans.second = v[i].second;
    }
  }
  cout << ans.first << ' ' << ans.second;
  cout << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long _ = 1;
  while (_--) {
    solve();
  }
  return 0;
}
