#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <random>
#include <ctime>
#include <chrono>
#include <iomanip>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e4 + 10, mod = 998244353;

inline void add(int &x, int y) { (x += y) >= mod && (x -= mod); }
inline void sub(int &x, int y) { (x -= y) < 0 && (x += mod); }

int n, m, fr[MAXN], to[MAXN];

int sum;
int f[MAXN], g[MAXN];
inline void Add(int x, int y)
{
    if (x > y) swap(x, y);
    sum += x, y -= x;
    if (!y) return;
    for (int i = n - y; i >= 0; i--)
        add(f[i + y], f[i]);
}
inline void Delete(int x, int y)
{
    if (x > y) swap(x, y);
    sum -= x, y -= x;
    if (!y) return;
    for (int i = 0; i <= n - y; i++)
        sub(f[i + y], f[i]);
}

bool col[MAXN];
int fa[MAXN], cnt[MAXN][2];
inline int Find(int k) { return k == fa[k] ? k : fa[k] = Find(fa[k]); }

bool tp[MAXN]; int pre[MAXN];

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m), n <<= 1;
    for (int i = 1; i <= m; i++) Read(fr[i]), Read(to[i]);
    f[0] = 1;
    for (int i = 1; i <= n; i++) Add(0, 1), fa[i] = i, cnt[i][0] = 1;
    for (int i = m; i >= 1; i--)
    {
        // cout << sum << '\n';
        int u = fr[i], v = to[i];
        // if (Find(u) == Find(v) && col[u] != col[v]) cout << u << ' ' << v << '\n';
        if (Find(u) == Find(v)) continue;
        int x0 = cnt[fa[u]][0], x1 = cnt[fa[u]][1];
        if (col[u] == col[v]) x0 += cnt[fa[v]][1], x1 += cnt[fa[v]][0];
        else x0 += cnt[fa[v]][0], x1 += cnt[fa[v]][1];
        for (int j = 0; j <= n; j++) g[j] = f[j];
        Delete(cnt[fa[u]][0], cnt[fa[u]][1]), Delete(cnt[fa[v]][0], cnt[fa[v]][1]), Add(x0, x1);
        if (!f[(n >> 1) - sum]) { for (int j = 0; j <= n; j++) f[j] = g[j]; continue; }
        else if (col[u] == col[v])
        {
            for (int j = 1; j <= n; j++)
                if (Find(j) == fa[v]) col[j] ^= 1;
            swap(cnt[fa[v]][0], cnt[fa[v]][1]);
        }
        // cout << u << ' ' << v << '\n';
        cnt[fa[u]][0] = x0, cnt[fa[u]][1] = x1, fa[fa[v]] = fa[u];
    }
    for (int i = 0; i <= n; i++) f[i] = g[i] = 0;
    f[0] = 1, sum = 0;
    for (int i = 1; i <= n; i++)
        if (fa[i] == i)
        {
            int x = cnt[i][0], y = cnt[i][1];
            if (x > y) swap(x, y), tp[i] = 1;
            sum += x, y -= x;
            for (int j = n - y; j >= 0; j--)
                if (!f[j + y] && f[j]) f[j + y] = 1, g[j + y] = i, pre[j + y] = j;
        }
    int x = (n >> 1) - sum;
    while (x) tp[g[x]] ^= 1, x = pre[x];
    for (int i = 1; i <= n; i++)
        if (tp[Find(i)]) col[i] ^= 1;
    for (int i = 1; i <= n; i++) cout << col[i]; cout << "\n";
    return 0;
}