//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ps ' '
#define debug(x) cerr<<#x<<':'<<x<<'\n';
#define edl '\n'
#define cehh cerr<<'\n';
typedef long long ll;
using namespace std;
inline ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();return x*f;}
void wrint(ll x,short e){if(x<0){putchar('-');x=-x;}if(x>9){wrint(x/10,0);}putchar(x%10+'0');if(e==1){putchar('\n');}if(e==2){putchar(' ');}}//0:啥也不加  1:换行  2:空格
const ll N=1e4 +10,INF=0x7f7f7f7f7f7f7f7f;

ll n=0,m=0,ans=0,enm[N],f[N];
int find(int x){
	if(f[x]!=x) f[x]=find(f[x]);
	return f[x];
}
int main(){
//	freopen("123.in","r",stdin);
//	freopen("123.out","w,",stdout);
	n=read();m=read();
	for(int i=1;i<=n+n;i++){
		f[i]=i;
	}
	for(int i=1;i<=m;i++){
		char c=getchar();
		int a=read(),b=read();
		if(c=='F'){
			f[find(a)]=find(b);
		}else{
			f[find(n+a)]=find(b);
			f[find(n+b)]=find(a);
		}
	}
	for(int i=1;i<=n;i++){
		if(f[i]==i) ans++;
	}
	wrint(ans,0);
//	fclose(stdin);
//	fclose(stdout);

	return 0;
}