#include<bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second

using namespace std;

const int INF=2e9;
const int MAXN=1e5+5;
const double EPS=0.000001;

mt19937 mt(123);
int perm[MAXN];

int n;
pair<double,double> lines[MAXN];

bool eq(double a,double b)
{
    return (abs(a-b)<EPS);
}

pair<int,int> inter(pair<double,double> a,pair<double,double> b)
{
    double x=(b.se-a.se)/(a.fi-b.fi);
    if(!eq(x,round(x))) return {INF,INF};
    double y=a.fi*x+a.se;
    if(!eq(y,round(y))) return {INF,INF};
    return {round(x), round(y)};
}

bool ison(pair<int,int> p,int ind)
{
    if(eq(lines[ind].fi*p.fi+lines[ind].se, p.se)) return 1;
    return 0;
}

int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

freopen("intersection.in","r",stdin);
freopen("intersection.out","w",stdout);

cin>>n;
for(int i=0;i<n;i++)
{
    int x1,y1,x2,y2;
    cin>>x1>>y1>>x2>>y2;
    lines[i].fi=((double)y2-y1)/((double)x2-x1);
    lines[i].se=(double)y1-lines[i].fi*x1;//cout<<lines[i].fi<<" "<<lines[i].se<<endl;
}

iota(perm,perm+n,0);
shuffle(perm,perm+n,mt);

for(int tt=0;tt<n;tt++)
{
    int ind=perm[tt];
    map<pair<int,int>, int> m;
    for(int i=0;i<n;i++)
    {
        if(i==ind) continue;
        if(eq(lines[i].fi,lines[ind].fi)) continue;

        auto p=inter(lines[i], lines[ind]);
        if(p.fi==INF) continue;
        m[p]++;//cout<<ind<<" "<<i<<" "<<m[p]<<endl;
    }
    bool fl=0;
    for(auto [t1,t2]: m)
    {
        if(t2>=n/4-1)
        {
            cout<<t1.fi<<" "<<t1.se<<endl;
            vector<int> l;
            for(int i=0;i<n;i++)
            {
                if(ison(t1,i)) l.push_back(i+1);
            }
            cout<<l.size()<<endl;
            for(auto ind: l) cout<<ind<<" ";
            cout<<endl;
            fl=1;
            break;
        }
    }
    if(fl) break;
}

return 0;
}