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

const double eps=1e-8;

struct Point_3D
{
	double x,y,z;
	Point_3D(){}
	Point_3D(double x,double y,double z):x(x),y(y),z(z){}
};
typedef Point_3D Vector_3D;

double Dot_3D(Vector_3D A,Vector_3D B)
{
	return A.x*B.x+A.y*B.y+A.z*B.z;
}

Vector_3D Cross_3D(Vector_3D A,Vector_3D B)
{
	return Vector_3D(A.y*B.z-A.z*B.y,A.z*B.x-A.x*B.z,A.x*B.y-A.y*B.x);
}

Vector_3D operator + (Vector_3D A,Vector_3D B)
{
	return Vector_3D(A.x+B.x,A.y+B.y,A.z+B.z);
}

Vector_3D operator - (Vector_3D A,Vector_3D B)
{
	return Vector_3D(A.x-B.x,A.y-B.y,A.z-B.z);
}

Vector_3D operator * (Vector_3D A,double t)
{
	return Vector_3D(A.x*t,A.y*t,A.z*t);
}

//直线与平面的交点
Point_3D LinePlaneIntersection(Point_3D p1,Point_3D p2,Point_3D p0,Vector_3D n)
{
	Vector_3D v=p2-p1;
	double t=(Dot_3D(n,p0-p1)/Dot_3D(n,p2-p1));
	return p1+v*t;
}

bool SameSide(Point_3D p1,Point_3D p2,Point_3D a,Point_3D b)
{
	return Dot_3D(Cross_3D(b-a,p1-a),Cross_3D(b-a,p2-a))-eps>=0;
}

bool PointInTri(Point_3D P,Point_3D P0,Point_3D P1,Point_3D P2)
{
	return SameSide(P,P0,P1,P2)&&SameSide(P,P1,P0,P2)&&SameSide(P,P2,P0,P1);
}

bool TriSegInterseection(Point_3D P0,Point_3D P1,Point_3D P2,Point_3D A,Point_3D B,Point_3D &P)
{
	Vector_3D n=Cross_3D(P1-P0,P2-P0);

	if(fabs(Dot_3D(n,B-A))<=eps)
		return false;
	else
	{
		double t=Dot_3D(n,P0-A)/Dot_3D(n,B-A);
		if(t+eps<0||t-1-eps>0)
			return false;

		P=A+(B-A)*t;
		return PointInTri(P,P0,P1,P2);
	}
}

// bool TriTriIntersection(vector<Point_3D> T1,vector<Point_3D> T2)
// {
// 	int flag=0;

// 	for(int i=0;i<3;i++)
// 	{
// 		if(TriSegInterseection(T1[0],T1[1],T1[2],T2[i],T2[(i+1)%3]))
// 			flag++;
// 	}

// 	if(flag==1) return true;
// 	return false;
// }

bool PointOnPlane(Point_3D A,Point_3D B,Point_3D C,Point_3D D)
{
	return fabs(Dot_3D(Cross_3D(B-A,C-A),D-A))<=eps;
}

signed main()
{
	Point_3D t[6];
	for(int i=0;i<6;i++)
	{
		cin>>t[i].x>>t[i].y>>t[i].z;
	}

	vector<pair<int,int>> ans;
	for(int j=1;j<6;j++)
	{
		for(int k=j+1;k<6;k++)
		{
			vector<Point_3D> a,b;
			a.push_back(t[0]),a.push_back(t[j]),a.push_back(t[k]);
			for(int l=0;l<6;l++)
			{
				if(l==0||l==j||l==k) continue;
				b.push_back(t[l]);
			}

			int flag=0;
			for(int l=0;l<3;l++)
			{
				if(PointOnPlane(b[l],a[0],a[1],a[2]))
					flag+=PointInTri(b[l],a[0],a[1],a[2]);
				// if(PointInTri(b[l],a[0],a[1],a[2]))
				// {
				// 	if(j==4&&k==5)
				// 	cout<<l<<endl;
				// }
			}
			if(flag==1)
			{
				ans.push_back({j,k});
				continue;
			}

			flag=0;
			for(int i=0;i<3;i++)
			{
				Point_3D P;
				if(TriSegInterseection(a[0],a[1],a[2],b[i],b[(i+1)%3],P))
				{
					flag++;
					// if(j==4&&k==5)
					// 	cout<<i<<endl;
				}
			}

			if(flag==1)
			{
				ans.push_back({j,k});
			}
		}
	}

	cout<<ans.size()<<endl;
	for(int i=0;i<ans.size();i++)
		cout<<ans[i].first+1<<' '<<ans[i].second+1<<endl;

	return 0;
}