#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, maxn = 300005;
vector<int> g[maxn];
int n, m, vis[maxn], num[maxn], ans[maxn];
queue<int> que;
int main() {
  scanf("%d%d", &n, &m);
  while (m--) {
    int u, v;
    scanf("%d%d", &u, &v);
    g[u].push_back(v), g[v].push_back(u);
    num[u]++, num[v]++;
  }
  for (int i = 1; i <= n; i++) {
    ans[i] = 0;
    if (num[i] > 1) vis[i] = 1, que.push(i);
  }
  while (!que.empty()) {
    int u = que.front();
    que.pop();
    vis[u] = 0;
    if (num[u] <= 1) continue;
    ans[u] ^= 1;
    num[u] = 0;
    for (int i = 0; i < g[u].size(); i++) {
      int v = g[u][i];
      if (ans[u] == ans[v])
        num[u]++, num[v]++;
      else
        num[v]--;
      if (num[v] > 1) vis[v] = 1, que.push(v);
    }
    if (num[u] > 1) vis[u] = 1, que.push(u);
  }
  for (int i = 1; i <= n; i++) printf("%d", ans[i]);
  printf("\n");
  return 0;
}
