#include<iostream>
using namespace std;
int n,m,fa[2020],x,y,t;
char c;
int find(int x){
    if(x==fa[x])return x;
    else fa[x]=find(fa[x]);
}
int merge(int x,int y){
    int fx=find(x);
    int fy=find(y);
    if(fx!=fy)fa[fx]=fy;
}
int main(){
	cin>>n>>m;
    for(int i=1;i<=2*n;i++)fa[i]=i;
    while(m--){
        cin>>c>>x>>y;
        if(c=='F')merge(x,y);
        else{
            merge(y+n,x);
            merge(x+n,y);
        }
    }
    for(int i=1;i<=n;i++){
        if(fa[i]==i)t++;
    }
    cout<<t;
    return 0;
}