#include<bits/stdc++.h>
using namespace std;
int n,m,f[2500],sum,a,b;
char s;
inline int find(int x)
{
	if(f[x]!=x) return f[x]=find(f[x]);
	return x;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n*2;i++) f[i]=i;
	while(m--)
	{
		cin>>s;
		while(s!='E'&&s!='F') cin>>s;
		cin>>a>>b;
		if(s=='E')
		{
			f[find(a+n)]=b;
			f[find(b+n)]=a;
		}else f[find(a)]=find(b);
	}
	for(int i=1;i<=n;i++) 
		if(f[i]==i) sum++;
	cout<<sum;
}