#include <bits/stdc++.h>
using namespace std;
vector<int> gr[300005];
int n, m;
int col[300005];
void go(int now) {
  for (auto to : gr[now]) {
    if (col[to]) continue;
    col[to] = 3 - col[now];
    go(to);
  }
  int cnt = 0;
  for (auto to : gr[now]) {
    cnt += (col[to] == col[now]);
  }
  if (cnt > 1) col[now] = 3 - col[now];
}
int main() {
  int i, j;
  scanf("%d", &n);
  scanf("%d", &m);
  for (i = 1; i <= m; i++) {
    int u, v;
    scanf("%d", &u);
    scanf("%d", &v);
    gr[u].push_back(v);
    gr[v].push_back(u);
  }
  for (i = 1; i <= n; i++) {
    if (col[i]) continue;
    col[i] = 1;
    go(i);
  }
  for (i = 1; i <= n; i++) printf("%d", col[i] - 1);
  printf("\n");
  return 0;
}
