#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  vector<vector<int> > enemy(n);
  while (--m >= 0) {
    int a, b;
    cin >> a >> b;
    enemy[a - 1].push_back(b - 1);
    enemy[b - 1].push_back(a - 1);
  }
  vector<int> ret(n, -1);
  for (int i = 0; i < n; ++i) {
    int curr = i;
    for (;;) {
      int x = 0;
      int y = 0;
      int xEnemy = -1;
      int yEnemy = -1;
      for (unsigned j = 0; j < enemy[curr].size(); ++j) {
        int k = enemy[curr][j];
        if (ret[k] == 0) {
          ++x;
          xEnemy = k;
        } else {
          ++y;
          yEnemy = k;
        }
      }
      int currEnemy;
      if (x <= 1)
        currEnemy = xEnemy;
      else
        currEnemy = yEnemy;
      bool ok = true;
      if (currEnemy != -1) {
        for (unsigned j = 0; j < enemy[currEnemy].size(); ++j) {
          int k = enemy[currEnemy][j];
          if (ret[k] == ret[currEnemy]) ok = false;
        }
      }
      if (x <= 1)
        ret[curr] = 0;
      else
        ret[curr] = 1;
      if (ok) break;
      curr = currEnemy;
      ret[curr] = -1;
    }
  }
  for (int i = 0; i < n; ++i) cout << ret[i];
  cout << endl;
  return 0;
}
