#include<bits/stdc++.h>
using namespace std;
int n,m;
int fa[2010];

int find(int x){
	if(fa[x]==x) return x;
	fa[x]=find(fa[x]);
	return fa[x];
}

int merge(int x,int y){
	int fx=find(x);
	int fy=find(y);
	if(fx!=fy) fa[fy]=fx;
}

int main() {
	cin>>n>>m;
	int x,y;
	char t;
	
	for(int i=1;i<=2*n;i++){
		fa[i]=i;
	}
	
	for(int i=1;i<=m;i++){
		cin>>t>>x>>y;
		if(t=='F') merge(x,y);
		else{
			merge(y,x+n);
			merge(x,y+n);
		}
	}

	int ans=0;
	for(int i=1;i<=n;i++){
		if(fa[i]==i) ans++;
	} 
	
	cout<<ans;
	return 0;
}