//带权并查集

 #include<iostream>

 #include<cstdio>

 using namespace std;

 const int maxn = ;

 int f[maxn];

 int dep[maxn];//深度

 void init(int n){

     for(int i = ; i <= n ;i++){

         f[i] = i;

         dep[i] = ;

     }

 }

 int find(int x){

     if(x == f[x])

         return x;

     return f[x] = find(f[x]);

 } 

 void join(int x,int y){

     x = find(x);

     y = find(y);

     if(x == y)    return ;

     if(dep[x] < dep[y]){

         f[x] = y;

     }

     else{

         f[y] = x;

         if(dep[x] == dep[y])

             dep[x]++;

     }

 }

 bool same(int x,int y){

     return find(x) == find(y);

 }

 int main(){

     int n,k;

     int d,x,y;

     int ans = ;

     scanf("%d%d",&n,&k);

     init(n*);

     for(int i = ; i < k; i++){

         scanf("%d%d%d",&d,&x,&y);

         if(x <=  || x > n || y <=  || y > n || ( d ==  && x == y)){

             ans++;

             continue;

         }

         if(d == ){

             //xy同类

             if( same(x,y+n) || same(x,y+*n)){

                 ans++;

                 continue;

             }else{

                 join(x,y);

                 join(x+n , y+n);

                 join(x + *n, y + *n);

             }

         }else{

             //x吃y

             if(same(x,y)||same(x,y + *n)){

                 ans++;

                 continue;

             }else{

                 join(x,y+n);

                 join(x + n, y + *n);

                 join(x + *n,y);

             }

         }

     }

     printf("%d",ans);

     return ;

 }