#include <bits/stdc++.h>
using namespace std;
long long n, m;
long long sett[300005];
vector<long long> g[300005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  for (long long i = 1; i <= m; i++) {
    long long a, b;
    cin >> a >> b;
    g[a].emplace_back(b);
    g[b].emplace_back(a);
  }
  for (long long i = 1; i <= n / 2; i++) {
    sett[i] = 1;
  }
  queue<long long> q;
  for (long long i = 1; i <= n; i++) {
    long long cnt = 0;
    for (auto j : g[i]) {
      if (sett[j] == sett[i]) cnt++;
    }
    if (cnt > 1) q.push(i);
  }
  while (q.empty() == false) {
    long long u = q.front();
    q.pop();
    long long c = 0;
    for (auto j : g[u]) {
      if (sett[u] == sett[j]) c++;
    }
    if (c < 2) continue;
    sett[u] = 1 - sett[u];
    for (auto j : g[u]) {
      long long cnt = 0;
      for (auto k : g[j]) {
        if (sett[k] == sett[j]) cnt++;
      }
      if (cnt > 1) q.push(j);
    }
  }
  for (long long i = 1; i <= n; i++) cout << sett[i];
  return 0;
}
