#include <bits/stdc++.h>
using namespace std;
struct timer {
  time_t start;
  timer() { start = clock(); }
  ~timer() {
    cerr << 1. * (clock() - start) / CLOCKS_PER_SEC << " secs" << endl;
  }
};
int n, m;
vector<int> G[300010];
int ans[300010];
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  srand(time(NULL));
  cin >> n >> m;
  int a, b;
  for (int i = 0; i < (m); i++) {
    cin >> a >> b;
    a--, b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  queue<int> Q;
  for (int i = 0; i < (n); i++) {
    int e = 0;
    for (int j = 0; j < (((int)G[i].size())); j++)
      if (ans[G[i][j]] == ans[i]) e++;
    if (e > 1) Q.push(i);
  }
  int cur, adj, e;
  while (((int)Q.size())) {
    cur = Q.front();
    Q.pop();
    e = 0;
    for (int i = 0; i < (((int)G[cur].size())); i++) {
      if (ans[G[cur][i]] == ans[cur]) e++;
    }
    if (e <= 1) continue;
    ans[cur] = !ans[cur];
    for (int i = 0; i < (((int)G[cur].size())); i++) {
      adj = G[cur][i];
      e = 0;
      for (int j = 0; j < (((int)G[adj].size())); j++) {
        if (ans[G[adj][j]] == ans[adj]) e++;
      }
      if (e > 1) Q.push(adj);
    }
  }
  for (int i = 0; i < (n); i++) cout << ans[i];
}
