#include <bits/stdc++.h>
using namespace std;
set<pair<int, int> > s;
int n, m, x, y, u[500500], a[500500];
vector<int> g[500500];
void mod(int x, int val) {
  s.erase(make_pair(u[x], x));
  u[x] = val;
  s.insert(make_pair(u[x], x));
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &x, &y);
    --x;
    --y;
    g[x].push_back(y);
    g[y].push_back(x);
    u[x]++;
    u[y]++;
  }
  for (int i = 0; i < n; i++) s.insert(make_pair(u[i], i));
  memset(a, 0, sizeof(a));
  while (1) {
    set<pair<int, int> >::iterator it = s.end();
    --it;
    int x = it->second;
    if (u[x] <= 1) break;
    mod(x, g[x].size() - u[x]);
    for (int i = 0; i < g[x].size(); i++)
      mod(g[x][i], u[g[x][i]] + (a[x] == a[g[x][i]] ? -1 : 1));
    a[x] = 1 - a[x];
  }
  for (int i = 0; i < n; i++) cout << a[i];
}
