Motion Regulations (18) - and check the basic questions - gang

lives in a cityNPersonally, any two people who know each other are either friends or enemies, and are satisfied:

  1, My friend's friend is my friend;

  2, The enemy of my enemy is my friend;

All people who are friends form a gang.Tell you about thisNpersonalM pieces of information, that is, two people are friends, or two people are enemies, please write a program to calculate the city with the mostHow many gangs might there be?

Enter

The first line contains an integerN, the second line contains an integerM,1;

NextMLine DescriptionM pieces of information, the content is one of the following two: "0 X Y" means XandYis a friend;"1 X Y" means X and Y is the enemy.

Output

Contains an integer, the maximum possible number of gangs.

Sample input

6 4

1 1 4

0 3 5

0 4 6

1 1 2

Sample output

3