program lfdaf;
var v:array[1..1009,1..1009]of boolean;
viz:array[1..1009]of boolean;
f,g:text;
i,n,m,s,x,y:longint;
ok:boolean;

function caut:longint;
var i:integer;
begin
for i:=1 to n do if viz[i]=false then break;
caut:=i;
end;

procedure parcurgere(x:longint);
var p,u,vf,i:longint;
    c:array[1..1009]of longint;
begin
p:=1;u:=1;c[1]:=x;viz[x]:=true;
while p<=u do begin
              vf:=c[p];
              for i:=1 to n do if v[vf,i] and not viz[i] then begin
                                                  inc(u);
                                                  c[u]:=i;
                                                  viz[i]:=true;
                                                  end;
              inc(p);
end;end;

begin
assign(f,'dfs.in');reset(f);
assign(g,'dfs.out');rewrite(g);
readln(f,n,m);
for i:=1 to m do begin
    readln(f,x,y);
    v[x,y]:=true;v[y,x]:=true;
end;
{fillchar(v,sizeof(v),false);
fillchar(viz,sizeof(viz),false);}
s:=0;ok:=true;
while ok do begin
      i:=caut;
      if (i<>n)or((i=n)and(not viz[n])) then begin
                                             parcurgere(i);
                                             inc(s);
                                             end
                                        else ok:=false;
end;
writeln(g,s);
close(g);
end.