#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<int> col;
int n, m;
void dfs(int v) {
  int cnt = 0;
  for (size_t i = 0; i < g[v].size(); i++)
    if (col[g[v][i]] == col[v]) cnt++;
  if (cnt > 1) {
    col[v] ^= 1;
    for (size_t i = 0; i < g[v].size(); i++)
      if (col[g[v][i]] == col[v]) dfs(g[v][i]);
  }
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin >> n >> m;
  int x, y;
  g.resize(n);
  col.resize(n, 0);
  for (int i = 0; i < m; i++) {
    cin >> x >> y;
    x--, y--;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 0; i < n; i++) {
    dfs(i);
  }
  for (int i = 0; i < n; i++) cout << col[i];
  cout << endl;
  return 0;
}
