#include <bits/stdc++.h>
using namespace std;
template <typename T>
using V = vector<T>;
int gcdex(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int x1, y1;
  int g = gcdex(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return g;
}
inline int ADD_MOD(int a, int b) { return (a + b) % 1000000007; }
inline int MUL_MOD(int a, int b) { return (int64_t(a) * b) % 1000000007; }
inline int SUB_MOD(int a, int b) { return a >= b ? a - b : a + 1000000007 - b; }
int DIV_MOD(int a, int b) {
  int x, y;
  gcdex(b, 1000000007, x, y);
  int b1 = (x % 1000000007 + 1000000007) % 1000000007;
  return MUL_MOD(a, b1);
}
const long double EPS = 1. / 1e6;
inline bool EPS_EQUAL(long double a, long double b) {
  return abs(a - b) <= EPS;
}
inline bool EPS_LESS(long double a, long double b) { return b - a > EPS; }
inline bool EPS_GREATER(long double a, long double b) { return a - b > EPS; }
const int INF = 1e9;
struct Vec {
  int x, y;
  int index;
  long double angle;
};
bool sort_vec(const Vec &a, const Vec &b) { return a.angle < b.angle; };
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.precision(15);
  int n;
  cin >> n;
  V<Vec> a(n);
  for (int i = 0; i < n; ++i) {
    auto &v = a[i];
    v.index = i;
    cin >> v.x >> v.y;
    v.angle = atan2((long double)v.y, v.x);
    if (v.angle < 0) {
      v.angle += 2 * 3.14159265358979323846;
    }
  }
  sort(a.begin(), a.end(), sort_vec);
  long double minAngle = INF;
  int minI = 0;
  for (int i = 0; i < n; ++i) {
    long double angle = a[i].angle;
    long double dAngle;
    if (i < n - 1) {
      dAngle = a[i + 1].angle - angle;
    } else {
      dAngle = a[0].angle - (angle - 2 * 3.14159265358979323846);
    }
    if (dAngle < minAngle) {
      minAngle = dAngle;
      minI = i;
    }
  }
  cout << a[minI].index + 1 << " " << a[(minI + 1) % n].index + 1 << endl;
  return 0;
}
