#include <bits/stdc++.h>
using namespace std;
template <class T>
bool checkMin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool checkMax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
const int INF = 1e9;
const int MN = 3 * 1e5 + 5;
int n, m;
vector<int> adj[MN];
int color[MN];
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < (m); i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    adj[x - 1].push_back(y - 1);
    adj[y - 1].push_back(x - 1);
  }
  memset(color, 0, sizeof(color));
  queue<int> q;
  for (int i = 0; i < (n); i++) q.push(i);
  while (!q.empty()) {
    int u = q.front();
    int ne = 0;
    for (int i = 0; i < (((int)(adj[u]).size())); i++)
      ne += (color[u] == color[adj[u][i]]);
    if (ne > 1) {
      color[u] = !color[u];
      for (int i = 0; i < (((int)(adj[u]).size())); i++) q.push(adj[u][i]);
    }
    q.pop();
  }
  for (int i = 0; i < (n); i++) putchar('0' + color[i]);
  puts("");
  return 0;
}
