// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
//#define int long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define mod 998244353
struct modint{
	unsigned int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x<o.x?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

int n,m,a[maxn],b[maxn];
int fa[maxn],s[maxn];

int gf(int x){
	while(x!=fa[x])x=fa[x]=fa[fa[x]];
	return x;
}
void mg(int u,int v){
	u=gf(u),v=gf(v);
	if(u!=v) {
		fa[u]=v;
		s[v]+=s[u];
		s[u]=0;
	}
}
int c[maxn];

bool f[20005];
int ct[20005],pre[20005];
int szf=0;

bool chk(){
	int sum=0;
	For(i,1,n*2)sum+=c[i]*i;
	sum=szf;
	if(sum&1) assert(0);
	sum/=2;
	memset(f,0,sizeof f);
	f[0]=1;
	For(i,1,sum)if(c[i]){
		memset(ct,0,sizeof ct);
		For(j,i,sum){
			if(!f[j] && f[j-i] && ct[j-i]<c[i]){
				f[j]=1;
				ct[j]=ct[j-i]+1;
				pre[j]=i;
			}
		}
	}
	return f[sum];
}
int nd[maxn];

int vis[maxn];
vi  buc[maxn];

int ck[maxn];

signed main()
{
//	freopen("data.in","r",stdin);
//	freopen("my.out","w",stdout);
	n=read(),m=read();
	For(i,1,m)a[i]=read(),b[i]=read();
	For(i,1,n*4) {
		fa[i]=i;
		if(i<=n*2) s[i]=1; else s[i]=-1;
	}
	c[1]=n*2;
	szf=n*2;
	Rep(i,m,1){
		ck[i]=-1;
		if(gf(a[i])==gf(b[i]) || gf(a[i])==gf(b[i]+n*2)) continue;
		int u=gf(a[i]),v=gf(b[i]+n*2);
		int w1=abs(s[u]),w2=abs(s[v]),w3=abs(s[u]+s[v]);
		--c[w1],--c[w2],++c[w3];
		szf+=w3-w2-w1;
		bool ok=chk();
		if(ok){
	//		cout<<"dif "<<i<<"\n";
			mg(a[i],b[i]+n*2);
			mg(b[i],a[i]+n*2);
			ck[i]=1;
		}else{
	//		cout<<"sam "<<i<<"\n";
			++c[w2],--c[w3]; szf+=w2-w3;
			
			v=gf(b[i]);
			w2=abs(s[v]),w3=abs(s[u]+s[v]);
			--c[w2],++c[w3]; szf+=w3-w2;
			
			mg(a[i],b[i]);
			mg(a[i]+n*2,b[i]+n*2);
			ck[i]=0;
		}
	}
	
	int sum=0;
	For(i,1,n*2)sum+=c[i]*i; sum/=2;
	cerr<<"sum "<<sum<<"\n";
	chk();
	assert(f[sum]);
//	exit(0);
	
	int now=sum;
	while(now) /*cout<<"pre "<<pre[now]<<"\n",*/nd[pre[now]]++,now-=pre[now];
	
	For(i,1,n*4) vis[i]=-1,buc[gf(i)].pb(i);
	For(ii,1,n*2) {
		int i=gf(ii);
		if(vis[(i<=n*2?i:i-n*2)]!=-1) continue;
		
		int sz=abs(s[i]);
		int s1=0,s0=0;
		for(int x:buc[i]){
			if((x<=n*2)) vis[x]=1,++s1;
			else vis[x-n*2]=0,++s0;
		}
		if(s1>s0){
			for(int x:buc[i]) {
				if(x<=n*2) vis[x]^=1;
				else vis[x-n*2]^=1;
			}
		}
		if(nd[sz]){
		//	cout<<"flip "<<i<<"\n";
			--nd[sz];
			for(int x:buc[i]) {
				if(x<=n*2) vis[x]^=1;
				else vis[x-n*2]^=1;
			}
		}
	}
	For(i,1,n*2) cout<<vis[i];
	int ss=0;
	For(i,1,n*2) assert(vis[i]!=-1),ss+=(vis[i]!=0);
	assert(ss==n);
	Rep(i,m,1){
		if(ck[i]!=-1){
			if(ck[i]==1) assert(vis[a[i]]!=vis[b[i]]);
			else assert(vis[a[i]]==vis[b[i]]);
		}
	}
	return 0;
}
/*
3 1
1 2


3 2
5 6
4 6

6 3
1 2
2 3
3 4
*/