#include <bits/stdc++.h>
using namespace std;
const int MaxN = 300005;
int n, m;
int color[MaxN];
vector<int> g[MaxN];
int main() {
  cin.sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  bool change = true;
  while (change) {
    change = false;
    for (int i = 1; i <= n; i++) {
      int enemies = 0;
      for (int j = 0; j < (int)g[i].size(); j++)
        if (color[i] == color[g[i][j]]) enemies++;
      if (enemies >= 2) {
        change = true;
        color[i] = 1 - color[i];
      }
    }
  }
  for (int i = 1; i <= n; i++) cout << color[i];
  cout << endl;
  return 0;
}
