#include <bits/stdc++.h>
using namespace std;
void Get(int &Ret) {
  char CH;
  bool FL = 0;
  for (; CH = getchar(), CH < '0' || CH > '9';)
    if (CH == '-') FL = 1;
  for (Ret = CH - '0'; CH = getchar(), CH >= '0' && CH <= '9';
       Ret = Ret * 10 + CH - '0')
    ;
  FL && (Ret = -Ret);
}
void Get(long long &Ret) {
  char CH;
  bool FL = 0;
  for (; CH = getchar(), CH < '0' || CH > '9';)
    if (CH == '-') FL = 1;
  for (Ret = CH - '0'; CH = getchar(), CH >= '0' && CH <= '9';
       Ret = Ret * 10 + CH - '0')
    ;
  FL && (Ret = -Ret);
}
const int MAXN = 310000;
struct node {
  int v;
  node *next;
};
node Edge[MAXN * 2];
node *Ecnt = &Edge[0];
node *adj[MAXN];
inline void addedge(int u, int v) {
  node *p = ++Ecnt;
  p->v = v;
  p->next = adj[u];
  adj[u] = p;
}
int n, m;
void Read() {
  Get(n);
  Get(m);
  int i;
  for (i = 1; i <= m; i++) {
    int u, v;
    Get(u);
    Get(v);
    addedge(u, v);
    addedge(v, u);
  }
}
int col[MAXN];
void DFS(int u) {
  int cnt = 0;
  for (node *p = adj[u]; p; p = p->next)
    if (col[u] == col[p->v]) cnt++;
  if (cnt > 1) {
    col[u] ^= 1;
    for (node *p = adj[u]; p; p = p->next)
      if (col[u] == col[p->v]) DFS(p->v);
  }
}
void Solve() {
  int i;
  for (i = 1; i <= n; i++) DFS(i);
  for (i = 1; i <= n; i++) printf("%d", col[i]);
  printf("\n");
}
int main() {
  Read();
  Solve();
  return 0;
}
