#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define int long long
using namespace std;
typedef long long ll;
typedef vector<vector<ll>> mat;
const int INF = 1e9;

class UndirectedGraph
{
public:
    size_t n;
    vector<vector<int>> vertex_to;

    UndirectedGraph(size_t n) : n(n), vertex_to(n) {}

    void connect(int from, int to)
    {
        vertex_to[from].emplace_back(to);
        vertex_to[to].emplace_back(from);
    }

    vector<int>& operator[](int v)
    {
        return vertex_to[v];
    }

    void resize(size_t _n)
    {
        n = _n;
        vertex_to.resize(_n);
    }

    size_t degree(int v)
    {
        return vertex_to[v].size();
    }
};

signed main()
{
    int n, m;
    int a, b;

    cin >> n >> m;

    UndirectedGraph graph(n);
    vector<bool> deleted(n, false);

    REP(i,m) {
        cin >> a >> b;
        graph.connect(a, b);
    }

    for (int i=n-1; 0<=i; i--) {
        for (int to : graph.vertex_to[i]) {
            if (i < to && !deleted[to]) {
                deleted[i] = true;
                break;
            }
        }
    }

    bool zero = false;
    for (int i=n-1; 0<=i; i--) {
        if (!zero && deleted[i]) zero = true;
        if (zero || deleted[i]) cout << (deleted[i] & 1);
    }
    cout << endl;
}