#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 2;
int group[N], n, m, en[N];
vector<int> adj[N];
set<pair<int, int> > s;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int v, u;
    cin >> v >> u;
    v--, u--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 0; i < n; i++) {
    en[i] = adj[i].size();
    s.insert(pair<int, int>(en[i], i));
  }
  while (1) {
    set<pair<int, int> >::iterator it = s.end();
    it--;
    int v = it->second;
    if (en[v] <= 1) break;
    s.erase(pair<int, int>(en[v], v));
    en[v] = adj[v].size() - en[v];
    group[v] = 1 - group[v];
    s.insert(pair<int, int>(en[v], v));
    for (int i = 0; i < adj[v].size(); i++) {
      int u = adj[v][i];
      s.erase(pair<int, int>(en[u], u));
      if (group[v] == group[u])
        en[u]++;
      else
        en[u]--;
      s.insert(pair<int, int>(en[u], u));
    }
  }
  for (int i = 0; i < n; i++) cout << group[i];
  cout << '\n';
  return 0;
}
