#include <bits/stdc++.h>
using namespace std;
inline void pin(int n) { printf("%d\n", n); }
double PI = acos(-1);
const int inf = 0x3f3f3f3f;
long long int StoI(string &s) {
  long long int sum = 0;
  for (long long int i = 0; i < s.size(); i++) {
    s[i] -= '0';
    sum = sum * 10 + s[i];
  }
  return sum;
}
long long int power(long long int a, long long int n) {
  long long int p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
long long int power(long long int a, long long int n, long long int mod) {
  long long int p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
vector<pair<long double, int> > v;
long double diff(long double a, long double b) {
  long double c = abs(a - b);
  return min(c, 360 - c);
}
int main() {
  int t;
  t = 1;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
      long double x, y;
      cin >> x >> y;
      long double c = atan2(x, y) * (180 / PI);
      if (c <= 0) c += 360;
      v.push_back({c, i + 1});
    }
    sort(v.begin(), v.end());
    v.push_back({v[0].first + 360, v[0].second});
    pair<int, int> ans;
    double mi = 878;
    for (int i = 0; i < n; i++) {
      if (diff(v[(i + 1)].first, v[i].first) < mi) {
        mi = diff(v[(i + 1)].first, v[i].first);
        ans.first = v[(i + 1)].second;
        ans.second = v[i].second;
      }
    }
    cout << ans.first << " " << ans.second << endl;
  }
  return 0;
}
