#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<int, int>, vector<pair<int, int> >,
               greater<pair<int, int> > >
    que;
stringstream ssin;
const long long LINF = 0x7fffffffffffffffll;
const int N = 4e5 + 5, M = 6e5 + 5, mod = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, idx;
int e[M], ne[M], h[N];
int col[N];
inline int read() {
  char c = getchar();
  int x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
void add(int a, int b) {
  e[idx] = b;
  ne[idx] = h[a];
  h[a] = idx++;
}
void dfs(int u) {
  int cnt = 0;
  for (int i = h[u]; ~i; i = ne[i]) {
    int v = e[i];
    if (col[u] == col[v]) cnt++;
  }
  if (cnt > 1) {
    col[u] = 1 - col[u];
    for (int i = h[u]; ~i; i = ne[i]) {
      int v = e[i];
      if (col[u] == col[v]) dfs(v);
    }
  }
}
int main() {
  n = read();
  m = read();
  memset(h, -1, sizeof h);
  ;
  for (int i = 1; i <= m; ++i) {
    int a, b;
    a = read();
    b = read();
    add(a, b);
    add(b, a);
  }
  bool flag = 1;
  for (int i = 1; i <= n; ++i) dfs(i);
  for (int i = 1; i <= n; ++i) printf("%d", col[i]);
  puts("");
}
