#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4 * 1000 * 100 + 100;
int n, m, used[MAXN], a, b;
vector<int> g[MAXN];
void dfs(int v) {
  int cnt = 0;
  for (int i = 0; i < g[v].size(); i++) {
    int to = g[v][i];
    if (used[to] == used[v]) cnt++;
  }
  if (cnt > 1) {
    used[v] = 1 - used[v];
    for (int i = 0; i < g[v].size(); i++) {
      int to = g[v][i];
      if (used[to] == used[v]) dfs(to);
    }
  }
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  for (int i = 1; i <= n; i++) dfs(i);
  for (int i = 1; i <= n; i++) cout << used[i];
  return 0;
}
