#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a,i##end=b; i<=i##end; i++)
#define drep(i,a,b) for(int i=a,i##end=b; i>=i##end; i--)
#define repp(i,a,b) for(int i=a,i##end=b; i<i##end; i++)
#define drepp(i,a,b) for(int i=a,i##end=b; i>i##end; i--)
#define Erep(i,x) for(int i=head[x]; i; i=Edge[i].nxt)
#define Srep(i,x) for(int i=x,i##end=x; i; i=(i-1)&i##end)
#define debug(x) cerr<<#x<<" = "<<x<<endl
#define fi first
#define se second
#define PII pair<int,int>
#define coint const int
#define ms(x,a) memset(x,a,sizeof x)
#define CM cerr<<(&S2-&S1)/1024.<<"KB"<<endl
//std::mt19937_64 Rnd {std::chrono::steady_clock::now().time_since_epoch().count()};
// Rnd();
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
template<class T>inline T lowbit(const T &x) { return x&-x; }

coint N=1e5+5;
int n,m;
int sz[N][2],f[N],dis[N];
ll dp[N];

PII find(int x){
	if(x==f[x]) return make_pair(x,0);
	PII fx=find(f[x]);
	f[x]=fx.fi;
	dis[x]^=fx.se;
	return make_pair(f[x],dis[x]);
}

void back(int a, int b){
	if(a>=1) rep(i,a,n<<1) dp[i]-=dp[i-a];
	if(b>=1) rep(i,b,n<<1) dp[i]-=dp[i-b];
}

void insert(int a, int b){
	if(a>=1) drep(i,n<<1,a) dp[i]+=dp[i-a];
	if(b>=1) drep(i,n<<1,b) dp[i]+=dp[i-b];
}

void solve2(PII fx, PII fy){
	back(sz[fx.fi][0],sz[fx.fi][1]);
	back(sz[fy.fi][0],sz[fy.fi][1]);
	insert(sz[fx.fi][fx.se]+sz[fy.fi][fy.se^1],sz[fx.fi][fx.se^1]+sz[fy.fi][fy.se]);
	if(dp[n]){
		f[fy.fi]=fx.fi;
		dis[fy.fi]=fx.se^fy.se^1;
		sz[fx.fi][fx.se]+=sz[fy.fi][fy.se^1];
		sz[fx.fi][fx.se^1]+=sz[fy.fi][fy.se];
		sz[fy.fi][fy.se]=sz[fy.fi][fy.se^1]=0;
	}else{
		back(sz[fx.fi][fx.se]+sz[fy.fi][fy.se^1],sz[fx.fi][fx.se^1]+sz[fy.fi][fy.se]);	
		f[fy.fi]=fx.fi;
		dis[fy.fi]=fx.se^fy.se;
		sz[fx.fi][fx.se]+=sz[fy.fi][fy.se];
		sz[fx.fi][fx.se^1]+=sz[fy.fi][fy.se^1];
		sz[fy.fi][fy.se]=sz[fy.fi][fy.se^1]=0;
		insert(sz[fx.fi][fx.se]+sz[fy.fi][fy.se],sz[fx.fi][fx.se^1]+sz[fy.fi][fy.se^1]);
	}
//	rep(i,1,n<<1){
//		int x=find(i).fi;
//		cout<<"i = "<<i<<" , find("<<i<<") = "<<x<<" , sz = "<<sz[x][0]<<" "<<sz[x][1]<<"\n";
//	}
}
bool mark[N];
int ans[N];
int X[N*10],Y[N*10];

void solve(){
	dp[0]=1;
	cin>>n>>m;
	rep(i,1,n<<1) {
		f[i]=i;
		sz[i][0]=1; sz[i][1]=0;
		dis[i]=0;
		insert(1,0);
	}
	rep(i,1,m){
		cin>>X[i]>>Y[i];
	}
	drep(i,m,1){
//		cout<<"opt : "<<i<<"\n";
		int x=X[i],y=Y[i];
		PII fx=find(x),fy=find(y);
		if(fx.fi==fy.fi) continue;
		solve2(fx,fy);
	}
	int res=n;
	rep(i,1,n<<1){
		int x=find(i).fi;
//		cout<<"i = "<<i<<" , find("<<i<<") = "<<x<<" , sz = "<<sz[x][0]<<" "<<sz[x][1]<<"\n";
		if(mark[x]) continue;
		if(dp[res-sz[x][0]]) ans[x]=0,res-=sz[x][0];
		else ans[x]=1,res-=sz[x][1];
	}
	rep(i,1,n<<1){
		PII x=find(i);
		cout<<(ans[x.fi]^x.se);
	}
	cout<<"\n";
	return;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	int T=1;
//	cin>>T;
	while(T--) solve();
	return 0;
}