#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double eps = 1e-8;
const int nm = 300005;
int n, k, m, t;
int res[nm];
vector<int> V[nm];
bool Check(int x, int side) {
  int i, j, sl = 0;
  for (i = 0; i < V[x].size(); i++)
    if (res[V[x][i]] == side) sl++;
  if (sl < 2) return 1;
  return 0;
}
void Asktogo(int x, int side) {
  int i, j, z, sl = 0;
  for (i = 0; i < V[x].size(); i++)
    if (res[V[x][i]] == side) z = V[x][i], sl++;
  if (sl == 0) return;
  sl = 0;
  for (i = 0; i < V[z].size(); i++)
    if (res[V[z][i]] == side) sl++;
  if (sl == 1) return;
  res[z] = 1 - side;
  Asktogo(z, 1 - side);
}
int main() {
  int i, j, x, y, z, w, sl;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= m; i++) {
    scanf("%d%d", &x, &y);
    V[x].push_back(y);
    V[y].push_back(x);
  }
  memset(res, -1, sizeof(res));
  res[1] = 0;
  for (i = 2; i <= n; i++) {
    sl = 0;
    for (j = 0; j < V[i].size(); j++)
      if (res[V[i][j]] == 0) sl++;
    if (sl <= 1) {
      res[i] = 0;
      Asktogo(i, 0);
    } else {
      res[i] = 1;
      Asktogo(i, 1);
    }
  }
  for (i = 1; i <= n; i++) printf("%d", res[i]);
  return 0;
}
