#include <bits/stdc++.h>
using namespace std;
int n;
int l[333333], v[333333][3];
int num[333333], pos[333333];
set<int> s[4];
int main() {
  int m, x, y;
  for (scanf("%d%d", &n, &m); m--;) {
    scanf("%d%d", &x, &y);
    v[x][l[x]++] = y;
    v[y][l[y]++] = x;
  }
  for (int i = 1; i <= n; i++) {
    num[i] = l[i];
    pos[i] = 0;
    s[num[i]].insert(i);
  }
  while (1) {
    if (s[3].empty()) {
      if (s[2].empty()) break;
      x = *s[2].begin();
    } else
      x = *s[3].begin();
    s[num[x]].erase(x);
    for (int j = 0; j < l[x]; j++) {
      y = v[x][j];
      s[num[y]].erase(y);
      if (pos[y] == pos[x])
        num[y]--;
      else
        num[y]++;
      s[num[y]].insert(y);
    }
    pos[x] = 1 - pos[x];
    num[x] = 3 - num[x];
    s[num[x]].insert(x);
  }
  for (int i = 1; i <= n; i++) printf("%d", pos[i]);
  return 0;
}
