#include <bits/stdc++.h>
using namespace std;
vector<long long> g[300000 + 1];
vector<long long> v(300000 + 1, 0);
bool check(long long x) {
  long long cnt = 0;
  for (auto it : g[x]) {
    if (v[it] == v[x]) cnt++;
  }
  return (cnt > 1);
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, m;
  cin >> n >> m;
  for (long long i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  queue<long long> q;
  for (long long i = 1; i <= n; i++) {
    if (check(i)) q.push(i);
  }
  while (!q.empty()) {
    long long d = q.front();
    q.pop();
    if (check(d)) {
      v[d] = !v[d];
      for (auto it : g[d])
        if (check(it)) q.push(it);
    }
  }
  for (long long i = 1; i <= n; i++) cout << v[i];
  return 0;
}
