#include <bits/stdc++.h>
using namespace std;
int n, m, r[300001];
vector<int> e[300001];
bool check(int x) {
  int d = 0;
  for (int i = 0; i < e[x].size(); i++) d += (r[x] == r[e[x][i]] ? 1 : 0);
  return d > 1;
}
void change(int x, int o) {
  if (check(x)) {
    r[x] = 1 - r[x];
    for (int i = 0; i < e[x].size(); i++)
      if (e[x][i] <= o) change(e[x][i], o);
  }
}
int main() {
  int x, y;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &x, &y);
    e[x - 1].push_back(y - 1);
    e[y - 1].push_back(x - 1);
  }
  for (int i = 0; i < n; i++) change(i, i);
  for (int i = 0; i < n; i++) printf("%d", r[i]);
  printf("\n");
  return 0;
}
