#include "iostream"
#include "algorithm"
#include "cstring"
#include "cstdio"
#include "cmath"
#include "vector"
#include "map"
#include "set"
#include "queue"
using namespace std;
#define MAXN 1000006
//#define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define all(x) (x).begin() , (x).end()
#define mem( a ) memset( a , 0 , sizeof a )
typedef long long ll;
#define int long long
const ll P = 1e18 + 9;
int n , m;
int A[MAXN] , B[MAXN];
int fa[MAXN] , wf[MAXN] , sz[MAXN][2];
int find( int x ) {
    return x == fa[x] ? x : find( fa[x] );
}
int gw( int x ) {
    return x == fa[x] ? 0 : wf[x] ^ gw( fa[x] );
}
int gsz( int u ) {
    return sz[u][0] + sz[u][1];
}
void connect( int u , int v , int w ) {
    int wu = gw( u ) , wv = gw( v ) , fu = find( u ) , fv = find( v );
    if( fu == fv ) return;
    if( gsz( fu ) > gsz( fv ) ) swap( u , v ) , swap( fu , fv ) , swap( wu , wv );
    fa[fu] = fv , wf[fu] = wu ^ wv ^ w;
    sz[fv][0] += sz[fu][wu ^ wv ^ w] , sz[fv][1] += sz[fu][wu ^ wv ^ w ^ 1];
}

int qm( int x ) {
    return x < P ? x : x - P;
}

int dp[MAXN] , W;
void add( int a , int b ) {
    if( a > b ) swap( a , b );
    b -= a;
    W += b;
    if( !b ) return;
    for( int i = n * 2 ; i >= b ; -- i )
        dp[i] = qm( dp[i] + dp[i - b] );
}
void del( int a , int b ) {
    if( a > b ) swap( a , b );
    b -= a;
    W -= b;
    if( !b ) return;
    for( int i = b ; i <= n * 2 ; ++ i )
        dp[i] = qm( dp[i] + P - dp[i - b] );
}

void solve() {
    cin >> n >> m;
    rep( i , 1 , n * 2 ) A[i] = 1 , B[i] = i;
    rep( i , 1 , m ) scanf("%lld%lld",A + i + n + n,B + i + n + n);
    dp[0] = 1;
    rep( i , 1 , n * 2 ) {
        add( 0 , 1 );
        fa[i] = i , sz[i][0] = 1 , sz[i][1] = 0 , wf[i] = 0;
    }
    for( int i = m + n * 2 ; i >= 1 ; -- i ) {
        int a = A[i] , b = B[i];
        int aa = find( a ) , bb = find( b ) , wa = gw( a ) , wb = gw( b );
        if( aa == bb ) continue;
        del( sz[aa][0] , sz[aa][1] );
        del( sz[bb][0] , sz[bb][1] );
        pii na = mp( sz[aa][wa] + sz[bb][wb] , sz[aa][wa ^ 1] + sz[bb][wb ^ 1] );
        pii ta = mp( sz[aa][wa] + sz[bb][wb ^ 1] , sz[aa][wa ^ 1] + sz[bb][wb] );
        add( ta.fi , ta.se );
        if( W % 2 == 0 && dp[W / 2] ) {
            connect( a , b , 1 );
            continue;
        }
        del( ta.fi , ta.se );
        add( na.fi , na.se );
        connect( a , b , 0 );
    }
    rep( i , 1 , n * 2 ) putchar(gw( i ) + '0'); puts("");
}

signed main() {
//    int T;cin >> T;while( T-- ) solve();
    solve();
}