#include <bits/stdc++.h>
using namespace std;
struct enemyList {
  int n;
  int enemy[3];
  enemyList() { n = 0; }
  void add(int new_enemy) {
    enemy[n] = new_enemy;
    n++;
  }
};
int main() {
  int n, m;
  int a, b;
  cin >> n >> m;
  vector<enemyList> enemies(n);
  vector<int> group(n);
  vector<int> enemiesInGroup(n);
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    a--;
    b--;
    enemies[a].add(b);
    enemies[b].add(a);
    enemiesInGroup[a]++;
    enemiesInGroup[b]++;
  }
  queue<int> needAttention;
  for (int i = 0; i < n; i++) {
    if (enemiesInGroup[i] >= 2) {
      needAttention.push(i);
    }
  }
  int current, enemy;
  while (needAttention.size() > 0) {
    current = needAttention.front();
    needAttention.pop();
    if (enemiesInGroup[current] >= 2) {
      group[current] = 1 - group[current];
      enemiesInGroup[current] = enemies[current].n - enemiesInGroup[current];
      for (int j = 0; j < enemies[current].n; j++) {
        enemy = enemies[current].enemy[j];
        if (group[current] == group[enemy]) {
          enemiesInGroup[enemy]++;
          if (enemiesInGroup[enemy] >= 2) {
            needAttention.push(enemy);
          }
        } else {
          enemiesInGroup[enemy]--;
        }
      }
    }
  }
  string ans = "";
  for (int i = 0; i < n; i++) {
    ans += (group[i] == 0) ? "0" : "1";
  }
  cout << ans << "\n";
  return 0;
}
