#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<int, int> > q;
vector<int> G[300010];
int deg[300010], ans[300010];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    G[a].push_back(b);
    G[b].push_back(a);
    deg[a]++;
    deg[b]++;
  }
  for (int i = 1; i <= n; i++) q.push(make_pair(deg[i], i));
  while (q.top().first > 1) {
    pair<int, int> p = q.top();
    q.pop();
    if (deg[p.second] != p.first) continue;
    deg[p.second] = 0;
    for (__typeof((G[p.second]).begin()) it = (G[p.second]).begin();
         it != (G[p.second]).end(); it++) {
      if (ans[*it] == ans[p.second])
        deg[*it]--, q.push(make_pair(deg[*it], *it));
      else
        deg[*it]++, q.push(make_pair(deg[*it], *it)), deg[p.second]++;
    }
    ans[p.second] = 1 - ans[p.second];
  }
  for (int i = 1; i <= n; i++) printf("%d", ans[i]);
  puts("");
}
