#include <bits/stdc++.h>
using namespace std;
int color[300010];
vector<int> v[300010];
void dfs(int i) {
  int cou = 0;
  int j;
  for (j = 0; j < v[i].size(); j++) {
    if (color[i] == color[v[i][j]]) {
      cou++;
    }
  }
  if (cou >= 2) {
    color[i] = (color[i] + 1) % 2;
    for (j = 0; j < v[i].size(); j++) {
      if (color[i] == color[v[i][j]]) {
        dfs(v[i][j]);
      }
    }
  }
  return;
}
int main() {
  int n, m;
  cin >> n;
  cin >> m;
  int i;
  int x, y;
  for (i = 0; i < m; i++) {
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  for (i = 1; i <= n; i++) {
    dfs(i);
  }
  for (i = 1; i <= n; i++) {
    cout << color[i];
  }
  cout << endl;
  return 0;
}
