#include<cstdio>
#include<cstdlib>
const int maxn=100000+10;
int a[maxn];
using namespace std;
int find(int x)
{
if(x==a[x])
return x;
int temp;
temp=a[x];
a[x]=find(temp);//路径压缩
return a[x];
}
int main()
{
int x,y;
int ans;
while(scanf("%d",&x)==1)
{
ans=0;
for(int i=0;i<maxn;i++)
a[i]=i;//每个元素都是一个集合
while(x!=-1)
{
scanf("%d",&y);
x=find(x);
y=find(y);
if(x==y)++ans;
else
a[x]=y;
scanf("%d",&x);
}
printf("%d\n",ans);
}
return 0;
}
#include<cstdlib>
const int maxn=100000+10;
int a[maxn];
using namespace std;
int find(int x)
{
if(x==a[x])
return x;
int temp;
temp=a[x];
a[x]=find(temp);//路径压缩
return a[x];
}
int main()
{
int x,y;
int ans;
while(scanf("%d",&x)==1)
{
ans=0;
for(int i=0;i<maxn;i++)
a[i]=i;//每个元素都是一个集合
while(x!=-1)
{
scanf("%d",&y);
x=find(x);
y=find(y);
if(x==y)++ans;
else
a[x]=y;
scanf("%d",&x);
}
printf("%d\n",ans);
}
return 0;
}