#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300005;
int n, m;
vector<int> graph[MAXN];
char c[MAXN];
void check(int node) {
  int s = 0;
  for (auto i : graph[node]) {
    if (c[i] == c[node]) s++;
  }
  if (s > 1) {
    if (c[node] == '0')
      c[node] = '1';
    else
      c[node] = '0';
    for (auto i : graph[node]) {
      check(i);
    }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--;
    b--;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  for (int i = 0; i < n; ++i) c[i] = '0';
  for (int i = 0; i < n; ++i) {
    check(i);
  }
  puts(c);
}
