#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;

const int MAXN = 5000+5;
int n, m, nn;
int par[MAXN*4], sz1[MAXN*4], sz2[MAXN*4];
int vis[MAXN*4], ans[MAXN*4];
vector<pii> ps;

int trans(int x){
    if(x > nn){
        return x - nn;
    }
    return x + nn;
}

int find(int x){
    return par[x] == x ? par[x] : par[x] = find(par[x]);
}

void unite(int x, int y){
    x = find(x);
    y = find(y);
    if(x > y) swap(x, y);
    par[y] = x;
    sz1[x] += sz1[y];
    sz2[x] += sz2[y];
}

int check(vector<pii> vec){
    int A = 0, B = 0;
    for(pii p : vec){
        int a = p.first, b = p.second;
        if(a > b) swap(a, b);
        if(A < B){
            A += b;
            B += a;
        }
        else{
            A += a;
            B += b;
        }
        if(A > n || B > n){
            return 0;
        }
    }
    return 1;
}

void solve(int a, int b){
    if(find(a) == find(b)) return;
    if(find(a) == find(trans(b))) return;
    int fa = find(a), fb = find(b);
    vector<pii> vec;
    for(int i = 1; i <= nn; i++){
        vis[i] = 0;
    }
    for(int i = 1; i <= nn; i++){
        find(i);
        find(trans(i));
        if(vis[par[i]] || vis[par[trans(i)]]) continue;
        if(par[i] == fa || par[i] == fb || par[trans(i)] == fa || par[trans(i)] == fb) continue;
        vec.push_back(pii(sz1[par[i]], sz2[par[i]]));
        vis[par[i]] = 1;
    }
    vec.push_back(pii(sz1[fa]+sz2[fb], sz2[fa]+sz1[fb]));
    // cout << "vec:\n";
    // for(auto p : vec){
    //     cout << p.first << " " << p.second << "\n";
    // }
    if(check(vec)){
        // cout << "unite1 " << a << " " << b << "\n";
        unite(a, trans(b));
        unite(b, trans(a));
    }
    else{
        // cout << "unite2 " << a << " " << b << "\n";
        unite(a, b);
        unite(trans(a), trans(b));
    }
}

int main(){
    cin >> n >> m;
    nn = n*2;
    for(int i = 0; i < m; i++){
        int a, b;
        cin >> a >> b;
        ps.push_back(pii(a, b));
    }
    for(int i = 1; i <= nn*2; i++){
        par[i] = i;
        if(i <= nn){
            sz1[i] = 1;
        }
        else{
            sz2[i] = 1;
        }
    }
    reverse(ps.begin(), ps.end());
    for(auto p : ps){
        solve(p.first, p.second);
    }
    for(int i = 1; i <= nn; i++){
        vis[i] = 0;
    }
    int A = 0, B = 0;
    for(int i = 1; i <= nn; i++){
        find(i);
        find(trans(i));
        if(vis[par[i]] || vis[par[trans(i)]]) continue;
        int rev = 0;
        pii p = pii(sz1[par[i]], sz2[par[i]]);
        if(p.first > p.second){
            rev = 1;
            swap(p.first, p.second);
        }
        if(A < B){
            B += p.first;
            A += p.second;
            ans[par[i]] = rev;
        }
        else{
            A += p.first;
            B += p.second;
            ans[par[i]] = rev^1;

        }
        vis[par[i]] = 1;
    }
    for(int i = 1; i <= nn; i++){
        cout << ans[par[i]];
    }
    return 0;
}