#pragma comment(linker, "/STACK:1024000000,1024000000")#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<algorithm>#include<iostream>using namespace std;map<string,int>m;char op1[50],op2[50],op3[50];int n,sz,ans,f[10000];vector<int>G[3100];void dfs(int x){    f[x]=1;    for(int i=0;i<G[x].size();i++)    {        if(f[G[x][i]]) continue;        dfs(G[x][i]);    }}int main(){    while(~scanf("%d",&n))    {        m.clear();        sz=1;        for(int i=1;i<=3000;i++) G[i].clear();        for(int i=1; i<=n; i++)        {            scanf("%s%s%s",op1,op2,op3);            int A,B,C;            if(m[op1]==0) m[op1]=sz++;            if(m[op2]==0) m[op2]=sz++;            if(m[op3]==0) m[op3]=sz++;            A=m[op1];            B=m[op2];            C=m[op3];            G[A].push_back(B);            G[B].push_back(A);            G[A].push_back(C);            G[C].push_back(A);            G[B].push_back(C);            G[C].push_back(B);        }        memset(f,0,sizeof f); ans=0;        for(int i=1;i<=sz-1;i++)        {            if(f[i]) continue;            ans++;            dfs(i);        }        printf("%d\n",ans);    }    return 0;}