program dsf1;
 var n,m,i,k,x,y:longint;
     a:array[0..10000,0..10000] of longint;
     viz:array[0..1000000] of boolean;
 procedure dsf(nod:longint);
 var i:longint;
 begin
 viz[nod]:=true;
 for i:=1 to n do if (not viz[i]) and (a[nod,i]=1) then dsf(i);
 end;
begin
  assign(input,'dsf.in'); reset(input);
  assign(output,'dsf.out'); rewrite(output);
  readln(n,m);
  for i:=1 to m do
    begin
    readln(x,y);
    a[x,y]:=1;
    a[y,x]:=1;
    end;
  for i:=1 to n do viz[i]:=false;
  k:=0;
  for i:=1 to n do
    if viz[i]=false then begin dsf(i); inc(k) end;
    write(k);
  close(output);
end.