#include <bits/stdc++.h>
using namespace std;
vector<int> edge[300008];
int ans[300008];
int main() {
  int n, m, i, j, t0, t1;
  bool flag;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) edge[i].clear();
  for (i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    edge[u].push_back(v);
    edge[v].push_back(u);
  }
  memset(ans, 0, sizeof(ans));
  flag = true;
  while (flag) {
    flag = false;
    for (i = 1; i <= n; i++) {
      int ss = edge[i].size();
      t0 = t1 = 0;
      for (j = 0; j < ss; j++) {
        if (ans[edge[i][j]])
          ++t1;
        else
          ++t0;
      }
      if (ans[i] == 0 && t0 >= 2) {
        ans[i] = 1;
        flag = true;
      } else if (ans[i] == 1 && t1 >= 2) {
        ans[i] = 0;
        flag = true;
      }
    }
  }
  for (i = 1; i <= n; i++) printf("%d", ans[i]);
  return 0;
}
