#include<stdio.h>
#include<string.h>
int n,m,map[1005][1005],vis[1005],a[1005];
void Dfs(int x)
{
int i,j;
vis[x]=1;
for(i=1; i<=n; i++)
if(!vis[i]&&map[x][i]==1)
Dfs(i);
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF&&n!=0)
{
int b,c,d,i,j;
memset(vis,0,sizeof(vis));
memset(a,0,sizeof(a));
memset(map,0,sizeof(map));
int flag=1;
for(i=1; i<=m; i++)
{
scanf("%d%d",&b,&c);
map[b][c]=map[c][b]=1;
a[b]++;
a[c]++;
}
Dfs(1);
for(i=1; i<=n; i++)
{
if(vis[i]==0||a[i]%2==1)
{
flag=0;
break;
}
}
if(flag==1)
printf("1\n");
else
printf("0\n");
}
return 0;
}