#include <bits/stdc++.h>
using namespace std;
int n, m;
const int N = 3e5 + 100;
int d[N], inq[N], b[N];
vector<int> G[N];
int q[N], h, t;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    G[u].push_back(v);
    G[v].push_back(u);
    d[u]++;
    d[v]++;
  }
  for (int i = 1; i <= n; i++)
    if (d[i] > 1) {
      q[++t] = i;
      inq[i] = true;
    }
  while (h <= t) {
    int u = q[h++];
    inq[u] = false;
    if (d[u] <= 1) continue;
    b[u] = !b[u];
    d[u] = G[u].size() - d[u];
    for (int i = 0; i < G[u].size(); i++) {
      int v = G[u][i];
      if (b[u] == b[v])
        d[v]++;
      else
        d[v]--;
      if (!inq[v] && d[v] > 1) {
        q[++t] = v;
        inq[v] = true;
      }
    }
  }
  for (int i = 1; i <= n; i++) cout << b[i];
  cout << endl;
  return 0;
}
