#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define MN 50000
#define S 0
#define TT 50004
#define SS 50002
#define T 50003
#define INF 2000000000
#define pa pair<int,int>
#define mp(x,y) make_pair(x,y)
using namespace std;
inline int read()
{int x = 0 , f = 1; char ch = getchar();while(ch < '0' || ch > '9'){ if(ch == '-') f = -1;  ch = getchar();}while(ch >= '0' && ch <= '9'){x = x * 10 + ch - '0';ch = getchar();}return x * f;
}struct Point{int x,y,id;}a[MN+5],b[MN+5],c[MN+5],d[MN+5];
struct edge{int to,next,w;}e[5000005];
int pos1[MN+5],pos2[MN+5],pos3[MN+5],aa[MN+5],pos4[MN+5],n,f[MN+5],g[MN+5],h[MN+5],ans=0,F[MN+5];
int head[T+5],D[T+5],cnt=1,C[T+5],q[MN+5],top=0,in[MN+5],out[MN+5],lt[MN+5],rt[MN+5];
vector<pa> to[MN*2+5];int mark[MN*2+5];
bool cmp1(Point a,Point b){return a.y==b.y?a.x<b.x:a.y<b.y;}
bool cmp2(Point a,Point b){return a.x==b.x?a.y<b.y:a.x<b.x;}
bool cmp3(Point a,Point b){return (a.x-a.y==b.x-b.y)?a.y<b.y:(a.x-a.y<b.x-b.y);}
bool cmp4(Point a,Point b){return (a.x+a.y==b.x+b.y)?a.y<b.y:(a.x+a.y<b.x+b.y);}
inline void R(int&a,int b){if(b>a)a=b;}
inline void ins(int f,int t,int w)
{    e[++cnt]=(edge){t,head[f],w};head[f]=cnt;e[++cnt]=(edge){f,head[t],0};head[t]=cnt;++out[f];++in[t];
}
void Solve(int i)
{if(pos2[a[i].id]>1&&b[pos2[a[i].id]-1].x==a[i].x)R(f[a[i].id],f[b[pos2[a[i].id]-1].id]+1);if(pos3[a[i].id]>1&&c[pos3[a[i].id]-1].x-c[pos3[a[i].id]-1].y==a[i].x-a[i].y)R(f[a[i].id],f[c[pos3[a[i].id]-1].id]+1);if(pos4[a[i].id]>1&&d[pos4[a[i].id]-1].x+d[pos4[a[i].id]-1].y==a[i].x+a[i].y)R(f[a[i].id],f[d[pos4[a[i].id]-1].id]+1);
}void Work(int i,int id,int tot)
{if(pos2[a[i].id]>1&&b[pos2[a[i].id]-1].x==a[i].x&&f[b[pos2[a[i].id]-1].id]==tot-1)to[id].push_back(mp(b[pos2[a[i].id]-1].id,1));if(pos3[a[i].id]>1&&c[pos3[a[i].id]-1].x-c[pos3[a[i].id]-1].y==a[i].x-a[i].y&&f[c[pos3[a[i].id]-1].id]==tot-1)to[id].push_back(mp(c[pos3[a[i].id]-1].id,1));if(pos4[a[i].id]>1&&d[pos4[a[i].id]-1].x+d[pos4[a[i].id]-1].y==a[i].x+a[i].y&&f[d[pos4[a[i].id]-1].id]==tot-1)to[id].push_back(mp(d[pos4[a[i].id]-1].id,1));
}void Dfs(int I,int K,bool flag)
{if(I==n)return;int H=I+(K>1)*n;if(mark[H])return;mark[H]=1;to[H].clear();if(f[I]!=F[I]||(!mark[I]&&K==2)||(!mark[I+n]&&K==1)){Work(pos1[I],H,K&1?f[I]:F[I]);for(int ii=0;ii<to[H].size();++ii) {    ins(to[H][ii].first,I,INF),Dfs(to[H][ii].first,to[H][ii].second,flag); if(flag) printf("%d ",I),flag=0;}}to[H].clear();int i=pos1[I],j,k;if(K&1){for(j=i;j&&a[j].y==a[i].y;--j);++j;    for(k=i;k<=n&&a[k].y==a[i].y;++k);--k;for(int l=j;l<i;++l) if(f[I]==F[a[l].id]+i-j) to[H].push_back(mp(a[l].id,2));for(int ii=0;ii<to[H].size();++ii){Dfs(to[H][ii].first,to[H][ii].second,flag);if(flag){    for(int l=pos1[to[H][ii].first]-1;l>=j;--l) printf("%d ",a[l].id);for(int l=pos1[to[H][ii].first]+1;l<=i;++l) printf("%d ",a[l].id);flag=0;    }}to[H].clear();for(int l=k;l>i;--l)if(f[I]==F[a[l].id]+k-i)to[H].push_back(mp(a[l].id,2));for(int ii=0;ii<to[H].size();++ii) {Dfs(to[H][ii].first,to[H][ii].second,flag);if(flag){for(int l=pos1[to[H][ii].first]+1;l<=k;++l) printf("%d ",a[l].id); for(int l=pos1[to[H][ii].first]-1;l>=i;--l) printf("%d ",a[l].id);flag=0;}} }to[H].clear();
}int dfs(int x,int f)
{if(x==TT) return f;int used=0;for(int&i=C[x];i;i=e[i].next)if(e[i].w&&D[e[i].to]==D[x]+1){int w=dfs(e[i].to,min(e[i].w,f-used));used+=w;e[i].w-=w;e[i^1].w+=w;if(f==used) return f; }    return D[x]=-1,used;
}bool bfs()
{memset(D,0,sizeof(D));int i,j;for(D[q[top=i=1]=SS]=1;i<=top;++i)for(j=C[q[i]]=head[q[i]];j;j=e[j].next)if(e[j].w&&!D[e[j].to]) D[q[++top]=e[j].to]=D[q[i]]+1;return D[TT];
}int main()
{n=read();memset(f,128,sizeof(f));f[n+1]=0;for(int i=1;i<=n;++i) a[i].x=b[i].x=c[i].x=d[i].x=read(),a[i].y=b[i].y=c[i].y=d[i].y=read(),a[i].id=b[i].id=c[i].id=d[i].id=i;++n;a[n].id=b[n].id=c[n].id=d[n].id=n;sort(a+1,a+n+1,cmp1);sort(b+1,b+n+1,cmp2); sort(c+1,c+n+1,cmp3);sort(d+1,d+n+1,cmp4);for(int i=1;i<=n;++i) pos1[a[i].id]=pos2[b[i].id]=pos3[c[i].id]=pos4[d[i].id]=i;    for(int i=1,j;i<=n;i=j+1){for(j=i;j<=n&&a[j].y==a[i].y;++j)Solve(j),F[a[j].id]=f[a[j].id];--j;g[i-1]=h[j+1]=-INF;for(int k=i;k<=j;++k) g[k]=max(g[k-1],f[a[k].id]); for(int k=j;k>=i;--k) h[k]=max(h[k+1],f[a[k].id]);for(int k=i;k<=j;++k) R(f[a[k].id],max(g[k-1]+k-i,h[k+1]+j-k));for(int k=i;k<=j;++k) R(ans,f[a[k].id]);}printf("%d\n",ans);bool Flag=1;for(int i=1;i<=n;++i) if(f[i]==ans) Dfs(i,1,Flag),Flag=false;puts("");ans=0;for(int i=1;i<=n;++i) if(in[i]<out[i]) ins(i,TT,out[i]-in[i]);else if(out[i]<in[i]) ins(SS,i,in[i]-out[i]);    for(int i=1;i<=n;++i) ins(S,i,INF),ins(i,T,INF);while(bfs()) ans+=dfs(SS,INF);ins(T,S,INF);while(bfs()) ans+=dfs(SS,INF);printf("%d\n",e[cnt].w);return 0;
}