#include <bits/stdc++.h>
using namespace std;
const int N = 300011;
int ans[N];
vector<int> adj[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  queue<int> Q;
  for (int i = 0; i < n; i++) {
    int cnt = 0;
    for (int j : adj[i]) cnt += ans[j] == 0;
    if (cnt > 1) Q.push(i);
  }
  while (!Q.empty()) {
    int v = Q.front();
    Q.pop();
    int cnt = 0;
    for (int u : adj[v]) cnt += ans[u] == ans[v];
    if (cnt < 2) continue;
    ans[v] = 1 - ans[v];
    for (int u : adj[v]) {
      cnt = 0;
      for (int w : adj[u]) cnt += ans[w] == ans[u];
      if (cnt > 1) Q.push(u);
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i];
  return 0;
}
