#include <bits/stdc++.h>
using namespace std;
const int MAX = 3e5 + 5;
int n, m, c[MAX];
vector<int> g[MAX];
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);
  }
  while (1) {
    int ok = 0;
    for (int u = 1; u <= n; u++) {
      int e = 0;
      for (int v : g[u])
        if (c[u] == c[v]) e++;
      if (e > 1) {
        ok = 1;
        c[u] = c[u] ^ 1;
      }
    }
    if (!ok) break;
  }
  for (int i = 1; i <= n; i++) printf("%d", c[i]);
  printf("\n");
  return 0;
}
