#include <bits/stdc++.h>
using namespace std;
int n, m;
int vis[3 * 100010];
vector<int> g[3 * 100010];
void dfs(int u) {
  int len = g[u].size();
  int tot = 0;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (vis[v] == vis[u]) tot++;
  }
  if (tot >= 2) {
    vis[u] = 1 - vis[u];
    for (int i = 0; i < g[u].size(); i++) {
      int v = g[u][i];
      if (vis[v] == vis[u]) dfs(v);
    }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    g[a].push_back(b);
    g[b].push_back(a);
  }
  for (int i = 1; i <= n; i++) dfs(i);
  for (int i = 1; i <= n; i++) printf("%d", vis[i]);
  printf("\n");
  return 0;
}
