#include <bits/stdc++.h>
using namespace std;
vector<int> g[300010];
queue<int> qu;
int n, m, color[300010];
bool vis[300010];
void dfs(int u) {
  int cnt = 0;
  for (vector<int>::iterator v = g[u].begin(); v != g[u].end(); v++)
    if (color[*v] == color[u]) cnt++;
  if (cnt > 1) {
    color[u] = color[u] == 1 ? 0 : 1;
    for (vector<int>::iterator v = g[u].begin(); v != g[u].end(); v++)
      if (color[*v] == color[u]) dfs(*v);
  }
}
int main() {
  scanf("%d %d", &n, &m);
  while (m--) {
    int u, v;
    scanf("%d %d", &u, &v);
    g[u].push_back(v), g[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) dfs(i);
  for (int i = 1; i <= n; i++) printf("%d", color[i]);
  puts("");
}
