#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define eps 1e-7
#define MAXV 310
using namespace std;

struct pt
{
	double x, y, z;
	pt(){}
	pt(double _x, double _y, double _z): x(_x), y(_y), z(_z){}
	pt operator - (const pt p1){return pt(x - p1.x, y - p1.y, z - p1.z);}
	pt operator * (pt p){return pt(y*p.z-z*p.y, z*p.x-x*p.z, x*p.y-y*p.x);}		//²æ³Ë 
	double operator ^ (pt p){return x*p.x+y*p.y+z*p.z;}							//µã³Ë 
} P[MAXV];

struct fac
{
	int a, b, c; 
	bool ok;
} add, F[MAXV*4];
int mark[MAXV*4];
int n, cnt;
int to[MAXV][MAXV];
int fa[MAXV*4];
void dfs(int, int);
double vlen(pt a){return sqrt(a.x*a.x+a.y*a.y+a.z*a.z);}
double area(pt a, pt b, pt c){return vlen((b-a)*(c-a));}

double ptof(pt &p, fac &f)
{
	pt m = P[f.b]-P[f.a], n = P[f.c]-P[f.a], t = p-P[f.a];
	return (m * n) ^ t;
}

void deal(int p, int a, int b)
{
	int f = to[a][b];
	if (F[f].ok)
	{
		if (ptof(P[p], F[f]) > eps)
			dfs(p, f);
		else
		{
			add.a = b, add.b = a, add.c = p, add.ok = 1;
			to[p][b] = to[a][p] = to[b][a] = cnt;
			F[cnt++] = add;
		}
	}
}

void dfs(int p, int cur)
{
	F[cur].ok = 0;
	deal(p, F[cur].b, F[cur].a);
	deal(p, F[cur].c, F[cur].b);
	deal(p, F[cur].a, F[cur].c);
}
int isin(pt p,pt p0,pt p1,pt p2)
{
	pt aa,bb,cc;
	aa=p1-p0;
	bb=p2-p0;
	cc=p-p0;
	double k1=aa.x*bb.y*cc.z+aa.y*bb.z*cc.x+bb.x*cc.y*aa.z-(aa.z*bb.y*cc.x+aa.y*bb.x*cc.z+bb.z*cc.y*aa.x);
	double k2=(aa.z*bb.y*cc.x+aa.y*bb.x*cc.z+bb.z*cc.y*aa.x);
	if(fabs(k1)<eps)return 1;
	return 0;
}
int find(int x)
{
	if(x!=fa[x]){
		fa[x]=find(fa[x]);
	}
	return fa[x];
}
void unit(int x,int y)
{
	if(x<y)fa[y]=x;
	else fa[x]=y;
}
int solve()
{
	int i,j;
	int ans=0;
	int k1,k2,k3;
	int f1,f2;
	if (n < 4)
		return 1;
	cnt=0;
	for (i = 0; i < 4; i++)
	{
		add.a = (i+1)%4, add.b = (i+2)%4, add.c = (i+3)%4, add.ok = 1;
		if (ptof(P[i], add) > 0)
			swap(add.b, add.c);
		to[add.a][add.b] = to[add.b][add.c] = to[add.c][add.a] = cnt;
		F[cnt++] = add;
	}

	for (i = 4; i < n; i++)
	{
		for (j = 0; j < cnt; j++)
		{
			if (F[j].ok && ptof(P[i], F[j]) > eps)
			{
				dfs(i, j);
				break;
			}
		}
	}
	/*for (i = 0; i < cnt; i++)
		ret += F[i].ok * area(P[F[i].a], P[F[i].b], P[F[i].c]);*/
	for(i=0;i<cnt;i++){
		fa[i]=i;
		mark[i]=0;
	}
	for(i=0;i<cnt;i++){
		if(!F[i].ok)continue;
		for(j=i+1;j<cnt;j++){
			if(!F[j].ok)continue;
			k1=isin(P[F[i].a],P[F[j].a],P[F[j].b],P[F[j].c]);
			k2=isin(P[F[i].b],P[F[j].a],P[F[j].b],P[F[j].c]);
			k3=isin(P[F[i].c],P[F[j].a],P[F[j].b],P[F[j].c]);
			if(k1==1&&k2==1&&k3==1){
				f1=find(i);
				f2=find(j);
				unit(f1,f2);
			}
		}
	}
	ans=0;
	for(i=0;i<cnt;i++){
		if(!F[i].ok)continue;
		j=find(i);
		if(mark[j])continue;
		ans++;
		mark[j]=1;
	}
	return ans;
}
		
int main()
{
	int i,j,k;
	int flag;
	pt tmp;
	double sum;
	while(scanf("%d", &n)!=EOF){
		for (i = 0; i < n; i++)
			scanf("%lf%lf%lf", &P[i].x, &P[i].y, &P[i].z);
		flag=0;
		for(i=2;i<n;i++){
			sum=area(P[0],P[1],P[i]);
			if(fabs(sum)>eps){
				tmp=P[i];
				P[i]=P[2];
				P[2]=tmp;
				flag=1;
				break;
			}
		}
		for(i=3;i<n;i++){
			if(!isin(P[i],P[0],P[1],P[2])){
				tmp=P[i];
				P[i]=P[3];
				P[3]=tmp;
				break;
			}
		}
		printf("%d\n", solve());
	}
	return 0;
}