#include <bits/stdc++.h>
using namespace std;
int i, j, k, n, m, x, y, T, ans, big, cas, num, len;
bool flag;
int st[300005];
vector<int> G[300005];
int main() {
  scanf("%d%d", &n, &m);
  for (i = 1; i <= m; i++) {
    scanf("%d%d", &x, &y);
    G[x].push_back(y);
    G[y].push_back(x);
  }
  memset(st, 0, sizeof(st));
  flag = true;
  int t[2];
  while (flag) {
    flag = false;
    for (i = 1; i <= n; i++) {
      t[0] = t[1] = 0;
      for (j = 0; j < G[i].size(); j++) {
        t[st[G[i][j]]]++;
      }
      if (st[i] == 0 && t[0] >= 2) {
        st[i] = 1;
        flag = true;
      } else if (st[i] == 1 && t[1] >= 2) {
        st[i] = 0;
        flag = true;
      }
    }
  }
  for (i = 1; i <= n; i++) {
    printf("%d", st[i]);
  }
  printf("\n");
  return 0;
}
