#include <bits/stdc++.h>
using namespace std;
const int MAX = 3e5 + 10;
int col[MAX];
vector<int> g[MAX];
void dfs(int u) {
  col[u] ^= 1;
  for (int v : g[u]) {
    int cnt = 0;
    for (int w : g[v]) {
      if (col[w] == col[v]) cnt++;
      if (cnt > 1) break;
    }
    if (cnt > 1) dfs(v);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  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);
  }
  for (int i = 1; i <= n; i++) {
    int cnt = 0;
    for (int w : g[i]) {
      if (col[w] == col[i]) cnt++;
      if (cnt > 1) break;
    }
    if (cnt > 1) dfs(i);
  }
  for (int i = 1; i <= n; i++) cout << col[i];
  return 0;
}
