#include <bits/stdc++.h>
using namespace std;
int ans[300005] = {0}, n, m;
vector<int> eg[300005];
void dfs(int u) {
  int tmp = 0;
  for (int i = 0; i < eg[u].size(); i++) {
    int v = eg[u][i];
    if (ans[u] == ans[v]) tmp++;
  }
  if (tmp > 1) {
    ans[u] ^= 1;
    for (int i = 0; i < eg[u].size(); i++) {
      int v = eg[u][i];
      if (ans[u] == ans[v]) dfs(v);
    }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1, a, b; i <= m; i++) {
    scanf("%d%d", &a, &b);
    eg[a].push_back(b);
    eg[b].push_back(a);
  }
  for (int i = 1; i <= n; i++) dfs(i);
  for (int i = 1; i <= n; i++) printf("%d", ans[i]);
  puts("");
  return 0;
}
