#include <bits/stdc++.h>
using namespace std;
long double pi = 3.141592653589793238462643383279;
long long quad(pair<long long, long long> p) {
  if (p.first > 0 && p.second >= 0) {
    return 1;
  }
  if (p.first <= 0 && p.second > 0) {
    return 2;
  }
  if (p.first < 0 && p.second <= 0) {
    return 3;
  }
  if (p.first >= 0 && p.second < 0) {
    return 4;
  }
}
bool compare(pair<pair<long long, long long>, long long> a,
             pair<pair<long long, long long>, long long> b) {
  pair<long long, long long> p1 = a.first;
  pair<long long, long long> p2 = b.first;
  if (quad(p1) < quad(p2)) {
    return 1;
  } else if (quad(p1) > quad(p2)) {
    return 0;
  } else {
    long long qua = quad(p1);
    long long x1 = abs(p1.first);
    long long x2 = abs(p2.first);
    long long y1 = abs(p1.second);
    long long y2 = abs(p2.second);
    if (qua == 1 || qua == 3) {
      return y1 * x2 < y2 * x1;
    } else {
      return y2 * x1 < y1 * x2;
    }
  }
}
long double angle(pair<long long, long long> p1) {
  long double a1;
  long long q1 = quad(p1);
  if (q1 == 1) {
    a1 = atan(p1.second * (long double)1.0 / p1.first);
  } else if (q1 == 2) {
    if (p1.first == 0) {
      a1 = pi * (long double)0.5;
    } else
      a1 = pi + atan(p1.second * (long double)1.0 / p1.first);
  } else if (q1 == 3) {
    a1 = pi + atan(p1.second * (long double)1.0 / p1.first);
  } else {
    if (p1.first == 0) {
      a1 = pi * 1.5;
    } else
      a1 = 2.0 * pi + atan(p1.second * (long double)1.0 / p1.first);
  }
  return a1;
}
bool compare2(pair<long long, long long> p1, pair<long long, long long> p2) {
  return 1;
}
void bruteforce() {}
void solve() {
  long long n;
  cin >> n;
  vector<pair<pair<long long, long long>, long long>> v;
  for (long long i = 0; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    v.push_back({{x, y}, i});
  }
  sort(v.begin(), v.end(), compare);
  long double mn = 6 * pi;
  long long id1 = -1, id2 = -1;
  for (long long i = 0; i < n - 1; i++) {
    if (mn > angle(v[i + 1].first) - angle(v[i].first)) {
      mn = angle(v[i + 1].first) - angle(v[i].first);
      id1 = v[i].second;
      id2 = v[i + 1].second;
    }
  }
  if (mn > 2 * pi - angle(v[n - 1].first) + angle(v[0].first)) {
    mn = 2 * pi - angle(v[n - 1].first) + angle(v[0].first);
    id1 = v[n - 1].second;
    id2 = v[0].second;
  }
  cout << id1 + 1 << " " << id2 + 1;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long T = 1;
  while (T--) {
    solve();
  }
}
