#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
const int p=1019260817;
int f[10003],g[10003],U[1<<21],V[1<<21];
int fa[10003],sx[10003],sy[10003],col[10003];
int find(int x){return (fa[x]==x)?x:(fa[x]=find(fa[x]));}
int n=read()*2,m=read();
void reduce(int x,int y)
{
	for(int i=0; i+x<=n&&i+y<=n; ++i)
	{
		if(y)f[i+y]=(f[i+y]+p-f[i])%p;
		if(x)f[i+x]=(f[i+x]+p-f[i])%p;
	}
}
void insert(int x,int y)
{
	for(int i=n-max(x,y); i>=0; --i)
	{
		if(x)f[i+x]=(f[i+x]+f[i])%p;
		if(y)f[i+y]=(f[i+y]+f[i])%p;
	}
}
signed main()
{
	for(int i=1; i<=n; ++i) fa[i]=i,sx[i]=1;
	for(int i=m; i>=1; --i) U[i]=read(),V[i]=read();
	f[0]=1;
	for(int i=1; i<=n; ++i)
		for(int j=i; j>=1; --j)
			f[j]=(f[j]+f[j-1])%p;
	for(int i=2; i<=n; ++i) U[++m]=1,V[m]=i;
	for(int i=1; i<=m; ++i)
	{
		int u=find(U[i]),v=find(V[i]);
		if(u!=v)
		{
			// printf("%d %d\n",)
			reduce(sx[u],sy[u]);
			reduce(sx[v],sy[v]);
			if(col[U[i]]!=col[V[i]])
			{
				insert(sx[u]+sx[v],sy[u]+sy[v]);
				if(f[n/2])
				{
					// puts("A");
					sx[u]+=sx[v],sy[u]+=sy[v];
				}
				else
				{
					// puts("B");
					reduce(sx[u]+sx[v],sy[u]+sy[v]);
					for(int i=1; i<=n; ++i) if(find(i)==v) col[i]^=1;
					insert(sx[u]+sy[v],sy[u]+sx[v]);
					sx[u]+=sy[v],sy[u]+=sx[v];
				}
			}
			else
			{
				insert(sx[u]+sy[v],sy[u]+sx[v]);
				if(f[n/2])
				{
					// puts("A");
					for(int i=1; i<=n; ++i) if(find(i)==v) col[i]^=1;
					sx[u]+=sy[v],sy[u]+=sx[v];
				}
				else
				{
					// puts("B");
					reduce(sx[u]+sy[v],sy[u]+sx[v]);
					insert(sx[u]+sx[v],sy[u]+sy[v]);
					sx[u]+=sx[v],sy[u]+=sy[v];
				}
			}
			// printf("merge %d %d\n",U[i],V[i]);
			// printf("%d %d\n",sx[u],sy[u]);
			fa[v]=u;
			assert(f[n/2]);
		}	
	}
	for(int i=1; i<=n; ++i) printf("%d",col[i]);
	puts("");
	return 0;
}