#include <bits/stdc++.h>
using namespace std;

#define int long long


int X2, Y2, X1, Y1;

bool comp1(array<int, 3> cr1, array<int, 3> cr2) {
    int x1 = (cr1[0])-(X2);
    int x2 = (cr2[0])-(X2);
    int y1 = (cr1[1])-(Y2);
    int y2 = (cr2[1])-(Y2);

    if(x1*y2 < y1*x2) {
        return 0;
    } else if (x1*y2 == y1*x2) {
        return (x1<x2);
    }
    else{
        return 1;
    }
}

bool comp2(array<int, 3> cr1, array<int, 3> cr2) {
    int x1 = (cr1[0])-(X1);
    int x2 = (cr2[0])-(X1);
    int y1 = (cr1[1])-(Y1);
    int y2 = (cr2[1])-(Y1);

    if(x1*y2 > y1*x2) {
        return 0;
    } else if (x1*y2 == y1*x2) {
        return (x1>x2);
    } else {
        return 1;
    }
}

signed main() {
    ios_base::sync_with_stdio();
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    vector<array<int, 3> > crd(n-2);
    vector<array<int, 3> > crd2;
    vector<array<int, 3> > pr(n-2);


    cin >> X1 >> Y1 >> X2 >> Y2;

    for(int i = 0; i < n-2; i++) {
        cin >> crd[i][0] >> crd[i][1];
        crd[i][2] = i+3;
    }
    crd2 = crd;


    sort(crd.begin(), crd.end(), comp1);
    sort(crd2.begin(), crd2.end(),comp2);


    for(int i = 0; i < n-2; i++) {
        pr[crd[i][2]-3][0] = i;
        pr[crd2[i][2]-3][1] = i;
        pr[crd2[i][2]-3][2] = crd2[i][2]-3;
    }
    sort(pr.begin(), pr.end());



    int mx = -1, mxindex;
    int elozo = n+10;
    for(int i = 0; i < n-2; i++) {
        //cout << pr[i][0] << ' ' << pr[i][1] << endl;
        int hozzaad = 0;
        if (elozo < pr[i][1]) {
            hozzaad = pr[i][1]-elozo;
        }
        elozo = pr[i][1];
        //cout << pr[i][2]+3 << ' '<< (n-pr[i][0]-pr[i][1]+hozzaad) << endl;

        if (mx < (n-pr[i][0]-pr[i][1]+hozzaad)) {
            mx = (n-pr[i][0]-pr[i][1]+hozzaad);
            mxindex =pr[i][2];
        } else if (mx == (n-pr[i][0]-pr[i][1]+hozzaad) && mxindex > pr[i][2]) {
            mxindex = pr[i][2];
        }
    }
    cout << mxindex + 3 << ' ' << mx << endl;



}