#include<bits/stdc++.h>
#define MAXN 100001
#define INF -1000000001
using namespace std;
int a, b, c, d, n, sz, needed;
double dist;
struct Line
{
    double a, b, c;
} arr[MAXN];
double yy[MAXN];
unordered_map<int, vector<int> > mp;
void read()
{
    freopen("intersection.in", "r", stdin);
    freopen("intersection.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    needed = n / 4;
    for(int i = 0; i < n; i ++)
    {
        cin>>a>>b>>c>>d;
        arr[i].a = (d - b);
        arr[i].b = (a - c);
        arr[i].c = -(arr[i].a * a + arr[i].b * b);

    }
    /*cout<<endl;
    for(int i = 0; i < n; i ++) cout<<arr[i].a<<" "<<arr[i].b<<" "<<arr[i].c<<endl;*/
}
double findY(Line a, double x)
{
    return (-(a.a * x + a.c) / a.b);
}
double getDist(long long x)
{
    double dist = 2e9;
        for(int i = 0; i < n; i ++)
        {
            yy[i] = findY(arr[i], x);
        }
        sort(yy, yy + n);
        /*for(int i = 0; i < n; i ++)
        {
            cout<<yy[i]<<" ";
        }
        cout<<endl;*/
        for(int i = 0; i + needed <= n; i ++)
        {
            dist = min(dist, yy[i + needed - 1] - yy[i]);
        }
        return dist;
}
long long solve(long long bg)
{
    long long x = bg;
    dist = 2e9;
    double lastDist = 3e9;
    while(dist != 0)
    {
        dist = getDist(x);
        if(dist > lastDist)
        {
            return x;
        }
        lastDist = dist;
        x += 100000;
        //cout<<x<<" "<<dist<<endl;
    }
    return x;
}
int main()
{
    read();
    long long ret = solve(-1e9);
    long long x;
    for(int i = ret - 100000; i <= ret; i ++)
    {
        double dist = getDist(i);
        if(dist == 0)
        {
            x = i;
            break;
        }
    }
    long long ansInd;
    for(int i = 0; i < n; i ++)
    {
        long long lft = arr[i].a * x + arr[i].c;
        long long rgt = arr[i].b;
        if(arr[i].b != 0 && abs(lft) % abs(rgt) == 0)
        {
            long long yy = -(lft) / rgt;
            mp[yy].push_back(i);
        }
    }
    for(auto it = mp.begin(); it != mp.end(); it ++)
    {
        if((it->second).size() >= needed)
        {
            ansInd = it->first;
            break;
        }
    }
    cout<<x<<" "<<ansInd<<endl;
    cout<<mp[ansInd].size()<<endl;
    for(int i = 0; i < mp[ansInd].size(); i ++)
    {
        cout<<mp[ansInd][i] + 1<<" ";
    }
    cout<<endl;
    return 0;
}