#include <bits/stdc++.h>
using namespace std;
vector<int> inc[300300];
bool first[300300];
int n;
int calc(const int& who) {
  int answ = 0;
  for (int i = 0; i < inc[who].size(); ++i)
    if (first[who] == first[inc[who][i]]) ++answ;
  return answ;
}
void kill(const int& who) {
  int answ = 0;
  if ((rand() >> 3) & 1)
    first[who] ^= true;
  else
    for (int i = 0; i < inc[who].size(); ++i)
      if (first[who] == first[inc[who][i]])
        if (answ < 2 && (rand() >> 3) & 1) {
          first[inc[who][i]] ^= true;
          ++answ;
        }
}
int main() {
  srand(time(0));
  int m;
  scanf("%d%d", &n, &m);
  int t, enem;
  for (int i = 0; i < m; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    inc[a - 1].push_back(b - 1);
    inc[b - 1].push_back(a - 1);
  }
  bool sw = true;
  while (sw) {
    sw = false;
    for (int i = 0; i < n; ++i)
      if (first[i])
        if (calc(i) > 1) {
          sw = true;
          kill(i);
        }
    for (int i = 0; i < n; ++i)
      if (!first[i])
        if (calc(i) > 1) {
          sw = true;
          kill(i);
        }
  }
  int sz = 0;
  for (int i = 0; i < n; ++i)
    if (first[i] == first[0]) ++sz;
  bool who = first[0];
  for (int i = 0; i < n; ++i)
    if (first[i] == who)
      printf("0");
    else
      printf("1");
  return 0;
}
