//O
#include <bits/stdc++.h>
using namespace std;

const int N = 1e4 + 10;
int n, m, a[N], b[N], col[N], fa[N];
int sx[N], sy[N];
typedef long long ll;
const ll P = 998244853;
ll f[N], g[N];

int bs = 0;
void del(int x){
    if(!x) return;
    // printf("del %d\n", x);
    for(int i = x; i <= n+n; ++ i){
        f[i] = (f[i] + P - f[i-x]) % P;
    }
}
void ins(int x){
    if(!x) return;
    // printf("ins %d\n", x);
    for(int i = n+n; i >= x; -- i){
        f[i] = (f[i] + f[i-x]) % P;
    }
}
bool chk(){
    // int x;
    // printf("chk:%d\n", bs);
    // scanf("%d", &x);
    // printf("%d\n", f[n-bs]);
    return f[n-bs];
}

int main(){
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= m; ++ i){
        scanf("%d%d", &a[i], &b[i]);
        // a[i] = i;
        // b[i] = i+n;
    }
    f[0] = 1;
    for(int i = 1; i <= n + n; ++ i){
        fa[i] = i;
        sx[i] = 1;
        ins(1);
    }
    for(int i = m; i >= 1; -- i){
        int x = a[i], y = b[i];
        if(fa[x] == fa[y]){
            continue;
        }
        int xx = fa[x];
        int yy = fa[y];
        memcpy(g, f, sizeof(g));
        del(abs(sx[xx] - sy[xx]));
        bs -= min(sx[xx], sy[xx]);
        del(abs(sx[yy] - sy[yy]));
        bs -= min(sx[yy], sy[yy]);
        if(col[x] == col[y]){
            ins(abs(sx[xx]+sy[yy] - sx[yy]-sy[xx]));
            bs += min(sx[xx]+sy[yy], sx[yy]+sy[xx]);
        } else {
            ins(abs(sx[xx]+sx[yy] - sy[xx]-sy[yy]));
            bs += min(sx[xx]+sx[yy], sy[xx]+sy[yy]);
        }
        if(chk()){
            if(col[x] == col[y]){
                sx[xx] += sy[yy];
                sy[xx] += sx[yy];
            } else {
                sx[xx] += sx[yy];
                sy[xx] += sy[yy];
            }
            sx[yy] = sy[yy] = 0;
            for(int j = 1; j <= n+n; ++ j){
                if(fa[j] == yy){
                    fa[j] = xx;
                    if(col[x] == col[y]){
                        col[j] ^= 1;
                    }
                }
            }
        } else {
            memcpy(f, g, sizeof(g));
        }
        // for(int i = 1; i <= n + n; ++ i){
        //     printf("%d %d %d %d\n", fa[i], col[i], sx[i], sy[i]);
        // }
    }
    for(int i = 1; i <= n+n; ++ i){
        putchar(col[i]+'0');
    }
    return 0;
}