#include <bits/stdc++.h>
using namespace std;
int main() {
  int N, M;
  cin >> N >> M;
  vector<vector<int> > e(N + 1);
  vector<int> deg1(N + 1, 0);
  vector<int> deg2(N + 1, 0);
  vector<int> ans(N + 1, 0);
  for (int i = 0; i < M; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    e[a].push_back(b);
    e[b].push_back(a);
    ++deg1[a];
    ++deg1[b];
  }
  for (int i = 1; i <= N; ++i) {
    if (deg1[i] == 3) {
      ans[i] = 1;
      for (size_t j = 0; j < e[i].size(); ++j) {
        --deg1[e[i][j]];
        ++deg2[e[i][j]];
      }
    }
  }
  bool flag = true;
  while (flag) {
    flag = false;
    for (int i = 1; i <= N; ++i) {
      if (deg1[i] > 1 && ans[i] == 0) {
        flag = true;
        ans[i] = 1;
        for (size_t j = 0; j < e[i].size(); ++j) {
          --deg1[e[i][j]];
          ++deg2[e[i][j]];
        }
      } else if (deg2[i] > 1 && ans[i] == 1) {
        flag = true;
        ans[i] = 0;
        for (size_t j = 0; j < e[i].size(); ++j) {
          --deg2[e[i][j]];
          ++deg1[e[i][j]];
        }
      }
    }
  }
  for (int i = 1; i <= N; ++i) {
    printf("%d", ans[i]);
  }
  printf("\n");
  return 0;
}
