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


const int maxn = 10010;

int f[maxn];
vector<int> x[maxn];

int col[maxn], cnt[2];
int from[maxn], to[maxn];
vector<pair<int, int>> graph[maxn];


int find(int n) { return f[n] == n ? n : find(f[n]); }
void merge(int a, int b, int c=0) {
    a=find(a), b=find(b);
    if (a == b) return;

    if (x[a].size()<x[b].size()) swap(a, b);

    f[b] = a;

    while (x[b].size()) {
        if (c) {
            cnt[col[x[b].back()]]--;
            col[x[b].back()] ^= 1;
            cnt[col[x[b].back()]]++;
        }

        x[a].push_back(x[b].back());
        x[b].pop_back();
    }
}


int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif // LOCAL

    int n, m; cin >> n >> m;
    for (int i=0; i<2*n; ++i) {
        f[i] = i;
        x[i].push_back(i);
    }

    for (int i=0; i<m; ++i) {
        cin >> from[i] >> to[i];
        from[i]--;
        to[i]--;

        graph[from[i]].push_back({to[i], i});
        graph[to[i]].push_back({from[i], i});
    }

    for (int i=0; i<2*n; ++i) col[i] = -1;

    for (int i = m-1; i>=0; --i) {
        int u = from[i], v = to[i];

        if (find(u) == find(v)) continue;

        if (col[u]!=-1 && col[v]!=-1) merge(u, v, col[u]==col[v]);
        else if (col[u]!=-1) {
            if (cnt[1 - col[u]]<n) col[v] = 1 - col[u];
            else col[v] = col[u];
            cnt[col[v]]++;

            merge(u, v);
        } else if (col[v]!=-1) {
            if (cnt[1 - col[v]]<n) col[u] = 1 - col[v];
            else col[u] = col[v];
            cnt[col[u]]++;     

            merge(u, v);
        } else {
            col[u]=0, col[v]=1;
            cnt[col[u]]++;
            cnt[col[v]]++;

            merge(u, v);
        }
    }

    for (int i=0; i<2*n; ++i) {
        if (col[i] == -1)  col[i] = cnt[0]<n ? 0 : 1;

        cnt[col[i]]++;
        cout << col[i];
    }
    cout << endl;
    return 0;
}