#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300010;
int enemies[MAXN], party[MAXN];
int n, m;
vector<vector<int> > adj;
queue<int> q;
int main() {
  scanf("%d%d", &n, &m);
  adj.resize(n + 1);
  int a, b;
  memset(enemies, 0, sizeof enemies);
  memset(party, 0, sizeof party);
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &a, &b);
    adj[a].push_back(b);
    adj[b].push_back(a);
    enemies[a]++;
    enemies[b]++;
  }
  for (int i = 1; i <= n; i++) {
    if (enemies[i] > 1) q.push(i);
  }
  while (q.size() > 0) {
    int f = q.front();
    q.pop();
    if (enemies[f] > 1) {
      party[f] = 1 - party[f];
      for (int i = 0; i < adj[f].size(); i++) {
        int fe = adj[f][i];
        if (party[f] == party[fe]) {
          enemies[f]++;
          enemies[fe]++;
        } else {
          enemies[f]--;
          enemies[fe]--;
        }
        if (enemies[fe] > 1) q.push(fe);
      }
    }
  }
  for (int i = 1; i <= n; i++) cout << party[i];
  cout << "\n";
  return 0;
}
