#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct Point
{
long long x,y;
int id;
bool operator==(const Point &other)
    {
    return x==other.x && y==other.y;
    }
};

int fordul(Point &a,Point &b,Point &c)
{
long long s=(c.y-a.y)*(b.x-a.x)-(c.x-a.x)*(b.y-a.y);
return (s>0)-(s<0);
}
long long pitagorasz(Point &a,Point &b)
{
return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;cin>>n;
    vector<Point> pontok1(n);
    vector<Point> pontok2(n);
    for(int i=0;i<n;i++)
        {
        cin>>pontok1[i].x>>pontok1[i].y;
        pontok1[i].id=i;
        }
    pontok2=pontok1;
    sort(pontok1.begin()+2,pontok1.end(),[&](Point a,Point b)
         {
         if(fordul(pontok1[0],a,b)==0)
            {
            return pitagorasz(pontok1[0],a)>pitagorasz(pontok1[0],b);
            }
         return fordul(pontok1[0],a,b)<0;
         });
    //swap(pontok2[1],pontok2[0]);
    //cout<<pontok2[0].x<<" "<<pontok2[0].y<<"\n\n";
    sort(pontok2.begin()+2,pontok2.end(),[&](Point a,Point b)
         {
         if(fordul(pontok2[1],a,b)==0)
            {
            return pitagorasz(pontok2[1],a)>pitagorasz(pontok2[1],b);
            }
         return fordul(pontok2[1],  a,b)>0;
         });
    //for(int i=0;i<n;i++)cout<<pontok2[i].x<<" "<<pontok2[i].y<<"\n";
    //cout<<"\n\n\n";
    //for(int i=0;i<n;i++)cout<<pontok1[i].x<<" "<<pontok1[i].y<<"\n";
    pair<int,int> ans;
    vector<int> indexinp2(n),indexinp1(n);
    for (int i=2;i<pontok2.size();i++) {
        indexinp2[pontok2[i].id]=i;
        indexinp1[pontok1[i].id]=i;
    }
    ans.first=0;
    for(int id=2;id<n;id++)
        {
        int curr=n-indexinp1[id]-indexinp2[id]+4;
        //cout<<curr<<" "<<i<<"\n";
        if(curr>ans.first)
            {
            ans.first=curr;
            ans.second=id;
            }
        }
    cout<<ans.second+1<<" "<<ans.first;
    return 0;
}