#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n, m;
vector<int> g[N];
queue<int> q;
int color[N];
bool bad(int u) {
  int cnt = 0;
  for (auto v : g[u]) {
    if (color[v] == color[u]) ++cnt;
  }
  return cnt > 1;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0, a, b; i < m; ++i) {
    scanf("%d%d", &a, &b);
    g[a].push_back(b);
    g[b].push_back(a);
  }
  for (int i = 1; i <= n; ++i) {
    if (bad(i)) {
      q.push(i);
    }
  }
  while (q.size()) {
    int u = q.front();
    q.pop();
    if (bad(u)) {
      color[u] = 1 - color[u];
      for (auto v : g[u]) {
        if (bad(v)) {
          q.push(v);
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    printf("%d", color[i]);
  }
  puts("");
  return 0;
}
