#include<iostream>#include<algorithm>#define maxn 1010usingnamespacestd;
//UnionFindSetint fa[maxn<<1];
void init(int n){for(int i = 1; i <= n; i++)fa[i]=i;}
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
void merge(int x, int y){x=find(x);y=find(y);if(x==y)return;fa[x]=y;}
int main(){
int n, m;
cin>>n>>m;
init(maxn<<1);
for(int i = 1; i <= m; i++){
char op; int x, y;
cin>>op>>x>>y;
if(op=='F'){
merge(x,y);
//merge(x+n,y+n);
}else{
merge(x,y+n);
merge(x+n,y);
}
}
int a[maxn];
for(int i = 1; i <= n; i++)
a[i]=find(i);
sort(a+1,a+n+1);
int ans = 0;
for(int i = 1; i <= n; i++)
if(i==1 || a[i]!=a[i-1])
ans++;
cout<<ans<<'\n';
return0;
}